login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080644 a(1) = 5; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 6". 0
5, 7, 8, 9, 12, 13, 18, 24, 30, 31, 32, 36, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 66, 72, 73, 74, 75, 78, 79, 80, 81, 82, 83, 84, 90, 96, 102, 108, 109, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180, 186, 187, 188, 189, 190 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
FORMULA
{a(a(n))} = {6i, i >= 2}.
CROSSREFS
Sequence in context: A043353 A023726 A157724 * A309277 A180241 A047479
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane and Benoit Cloitre, Feb 28 2003
EXTENSIONS
More terms from Matthew Vandermast, Mar 13 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)