id:A025482 - OEIS Search Results

Search: id:A025482

Displaying 1-1 of 1 results found.

page 1

a(0) = 0; a(n) = a(n/3)/3 if n = a(n/3) = 0 (mod 3); a(n) = a(n-1)+1 otherwise.

+0
1

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

	OFFSET	`0,3`
	CROSSREFS	`Sequence in context: A101412 A053830 A033929 this_sequence A023125 A030108 A037904` `Adjacent sequences: A025479 A025480 A025481 this_sequence A025483 A025484 A025485`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`
	EXTENSIONS	`Bounded, conjectured maximum is a(257) = 17.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research