id:A096288 - OEIS Search Results

Search: id:A096288

Displaying 1-1 of 1 results found.

page 1

Let n=Sum(c(k)*2^k), c(k)=0,1, be the binary form of n, n=Sum(d(k)*3^k), d(k)=0,1,2, the ternary form; then a(n)=Sum(c(k)+d(k)).

+0
2

0, 2, 3, 3, 3, 5, 4, 6, 5, 3, 4, 6, 4, 6, 7, 7, 5, 7, 4, 6, 6, 6, 7, 9, 6, 8, 9, 5, 5, 7, 6, 8, 5, 5, 6, 8, 4, 6, 7, 7, 6, 8, 7, 9, 9, 7, 8, 10, 6, 8, 9, 9, 9, 11, 6, 8, 7, 7, 8, 10, 8, 10, 11, 9, 5, 7, 6, 8, 8, 8, 9, 11, 6, 8, 9, 9, 9, 11, 10, 12, 10, 4, 5, 7, 5, 7, 8, 8, 7, 9, 6, 8, 8, 8, 9, 11, 6, 8, 9, 7 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`a(n) mod 2 = doubled Thue-Morse sequence A095190`
	EXAMPLE	`n=11: 11=12^3+12^1+12^0, 1+1+1=3, 11=13^2+2*3^0, 1+2=3` `so a(11)=3+3=6.`
	CROSSREFS	`Cf. A095190, A010059, A010060.` `Sequence in context: A092308 A081831 A111912 this_sequence A136348 A137847 A097224` `Adjacent sequences: A096285 A096286 A096287 this_sequence A096289 A096290 A096291`
	KEYWORD	`easy,nonn`
	AUTHOR	`Miklos Kristof, Peter Boros (kristmikl(AT)freemail.hu), Jun 24 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research