id:A061392 - OEIS Search Results

Search: id:A061392

Displaying 1-1 of 1 results found.

page 1

a(n) = a(floor[n/3]) + a(ceiling[n/3]) with a(0) = 0 and a(1) = 1.

+0
6

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

	OFFSET	`0,4`
	COMMENT	`Number of nonnegative integers < n having no 1 in their ternary representation. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 23 2003; corrected by Henry Bottomley, Mar 24 2003`
	FORMULA	`a(n+1) + A081609(n) = n+1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 23 2003; corrected by Henry Bottomley, Mar 24 2003`
	CROSSREFS	`k appears A061393 times. Cf. A007089, A062756, A081608, A081609, A081611.` `Adjacent sequences: A061389 A061390 A061391 this_sequence A061393 A061394 A061395` `Sequence in context: A064658 A073578 A087866 this_sequence A048273 A024542 A098424`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 30 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research