id:A080574 - OEIS Search Results

Search: id:A080574

Displaying 1-1 of 1 results found.

page 1

a(1)=1, a(n)=a(n-1)+1 if n is odd and already in the sequence, a(n)=a(n-1)+2 if n is even and already in the sequence, a(n)=a(n-1)+3 otherwise.

+0
1

1, 4, 7, 9, 12, 15, 16, 19, 20, 23, 26, 28, 31, 34, 35, 37, 40, 43, 44, 46, 49, 52, 53, 56, 59, 61, 64, 66, 69, 72, 73, 76, 79, 81, 82, 85, 86, 89, 92, 94, 97, 100, 101, 103, 106, 108, 111, 114, 115, 118, 121, 123, 124, 127, 130, 132, 135, 138, 139, 142 (list; graph; listen)

	OFFSET	`1,2`
	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	`It appears that a(n) is asymptotic to cn where c=2.36... is the largest root of q^2-3q+3/2 = 0.`
	CROSSREFS	`Sequence in context: A007072 A007064 A086824 this_sequence A007066 A047537 A062458` `Adjacent sequences: A080571 A080572 A080573 this_sequence A080575 A080576 A080577`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre, Mar 23 2003`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research