Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130500 a(1)=1. a(n) = number of earlier terms of the sequence which divide (the number of positive integers which are <=n and missing from first (n-1) terms of sequence). +0
2
1, 1, 2, 3, 3, 4, 4, 5, 5, 4, 5 (list; graph; listen)
OFFSET

1,3

EXAMPLE

The positive integers which are <= 9 and are missing from the first 8 terms of the sequence are 6,7,8,9. The number of these integers is 4, so a(9) is the number of earlier terms which divide 4. Therefore a(9) = 5.

CROSSREFS

Cf. A130501.

Sequence in context: A061339 A073933 A056792 this_sequence A072073 A061716 A126236

Adjacent sequences: A130497 A130498 A130499 this_sequence A130501 A130502 A130503

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), May 31 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research