Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080641
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080641 a(1) = 4; 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 5". +0
1
4, 6, 7, 10, 11, 15, 20, 21, 22, 25, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 45, 50, 51, 52, 55, 56, 57, 58, 59, 60, 65, 70, 75, 76, 80, 85, 90, 95, 100, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 120, 125, 126, 127, 130, 135, 140, 145, 150, 155, 156, 157 (list; graph; listen)
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)

Index entries for sequences of the a(a(n)) = 2n family

FORMULA

{a(a(n))} = {5i, i >= 2}.

CROSSREFS

Cf. A080639, A080640, A079000.

Sequence in context: A032785 A096887 A023631 this_sequence A047234 A089532 A103401

Adjacent sequences: A080638 A080639 A080640 this_sequence A080642 A080643 A080644

KEYWORD

nonn,easy

AUTHOR

njas and Benoit Cloitre, Feb 28 2003

EXTENSIONS

More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Feb 28 2003

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research