Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126327
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126327 a(1) = 1. a(n) = smallest positive multiple of (number of earlier terms in sequence which divide n) which has yet to appear in the sequence. +0
1
1, 2, 3, 4, 5, 6, 7, 9, 12, 15, 8, 18, 10, 21, 16, 20, 11, 24, 13, 30, 28, 27, 14, 32, 22, 33, 36, 42, 17, 40, 19, 48, 44, 39, 45, 54, 23, 51, 52, 56, 25, 64, 26, 60, 66, 57, 29, 50, 34, 72, 68, 78, 31, 80, 63, 88, 76, 69, 35, 84, 37, 75, 90, 49, 81, 96, 38, 102, 92, 70, 41, 108 (list; graph; listen)
OFFSET

1,2

EXAMPLE

There are three terms among the first 8 terms of the sequence which divide 9 (a(1)=1,a(3)=3,a(8)=9). So a(9) is the smallest multiple of 3 which does not occur among the first 8 terms of the sequence. 3,6, and 9 occur earlier in the sequence, so a(9) = 12.

PROGRAM

(PARI) S=Set([1]); for(n=2, 100, d=length(setintersect(S, Set(divisors(n)))); k=d; while(setsearch(S, k), k+=d); S=setunion(S, [k]); print1(k, ", "); ) - Max Alekseyev (maxal(AT)cs.ucsd.edu), Jun 02 2007

CROSSREFS

Sequence in context: A072966 A059759 A042952 this_sequence A098132 A017900 A005708

Adjacent sequences: A126324 A126325 A126326 this_sequence A126328 A126329 A126330

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Mar 09 2007

EXTENSIONS

More terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), Jun 02 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research