login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100812 {a(n)} is monotone increasing, with a(1)=1, a(2)=3 and, for n>2, a(n) is the smallest integer such that a(n) mod a(j) is never a(i) for any pair i,j with 1<=i<j<n. 0
1, 3, 5, 9, 15, 17, 27, 29, 45, 47, 87, 89, 135, 227, 267, 269, 540, 674, 947, 1217, 1442, 1485, 2522, 2564, 2792, 2832, 2834, 2972, 3102, 3240, 3242, 3645, 3737, 4142, 4182, 4320, 4992, 5400, 5807, 6077, 7017, 7967, 8370, 8772, 8774, 9677, 9717, 9990, 9992 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..49.

EXAMPLE

a(8)<>28, since 28=1 mod 27. But the residues of 29 modulo 3,5,9,15,17 and 27 are 2,4,2,14,12 and 2, none of which are earlier terms of the sequence, so a(8)=29.

CROSSREFS

Sequence in context: A143512 A111249 A190804 * A274432 A190939 A018634

Adjacent sequences:  A100809 A100810 A100811 * A100813 A100814 A100815

KEYWORD

nonn

AUTHOR

John W. Layman, Jan 05 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)