The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A048274

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Let G be the graph with n vertices, the i-th vertex consisting of all multiples of i <= n, where edges indicate that the vertices intersect; a(n) = |n-(number of edges of G)|.
(history; published version)

#3 by Russ Cox at Sat Mar 31 10:22:51 EDT 2012

AUTHOR

Stephen P. Humphries (steve(AT)math.byu.edu)

Discussion

Sat Mar 31

10:22

OEIS Server: https://oeis.org/edit/global/355

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

Let G be the graph vith n vertices, the ith vertex consisting of all multiples of i <= n, where edges indicate that the vertices intersect; a(n) = |n-(number of edges of G)|.

KEYWORD

nonn,new

AUTHOR

Stephen P. Humphries (steve@math.byu.edu)

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

DATA

OFFSET

EXAMPLE

KEYWORD

AUTHOR

STATUS