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!)
A080708 a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 4" is satisfied. 0
5, 6, 7, 9, 12, 16, 20, 21, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 40, 41, 42, 44, 48, 52, 53, 56, 60, 64, 68, 72, 76, 80, 84, 88, 89, 90, 91, 92, 96, 100, 101, 104, 105, 106, 107, 108, 109, 110, 111, 112, 116, 117, 118, 120, 121, 122, 123, 124, 125, 126, 127 (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))} = { 4i : i >= 3 }.
CROSSREFS
Sequence in context: A072956 A241203 A279001 * A047576 A123123 A308892
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Mar 01 2003
EXTENSIONS
More terms from Matthew Vandermast, Mar 14 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 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)