id:A080644 - OEIS Search Results

Search: id:A080644

Displaying 1-1 of 1 results found.

page 1

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
1

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; 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))} = {6i, i >= 2}.`
	CROSSREFS	`Cf. A080639, A080640, A079000.` `Sequence in context: A137469 A043353 A023726 this_sequence A047479 A080720 A112250` `Adjacent sequences: A080641 A080642 A080643 this_sequence A080645 A080646 A080647`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas and Benoit Cloitre, Feb 28 2003`
	EXTENSIONS	`More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 13 2003`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research