id:A097686 - OEIS Search Results

Search: id:A097686

Displaying 1-1 of 1 results found.

page 1

a(n+1) = if a(n) is even then a(n)/2 else (a(n) + number of earlier occurrences of a(n)), a(1) = 1.

+0
3

1, 1, 2, 1, 3, 3, 4, 2, 1, 4, 2, 1, 5, 5, 6, 3, 5, 7, 7, 8, 4, 2, 1, 6, 3, 6, 3, 7, 9, 9, 10, 5, 8, 4, 2, 1, 7, 10, 5, 9, 11, 11, 12, 6, 3, 8, 4, 2, 1, 8, 4, 2, 1, 9, 12, 6, 3, 9, 13, 13, 14, 7, 11, 13, 15, 15, 16, 8, 4, 2, 1, 10, 5, 10, 5, 11, 14, 7, 12, 6, 3, 10, 5, 12, 6, 3, 11, 15, 17, 17, 18, 9, 14 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(A097687(n))=n and a(m)<n for m<A097687(n);` `A097688(n) = #{k: a(k)=1, 1<=k<=n}.`
	CROSSREFS	`Cf. A001221.` `Sequence in context: A035384 A153868 A066328 this_sequence A082666 A057938 A144623` `Adjacent sequences: A097683 A097684 A097685 this_sequence A097687 A097688 A097689`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 19 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research