id:A105670 - OEIS Search Results

Search: id:A105670

Displaying 1-1 of 1 results found.

page 1

a(1)=1 then letting f(n)=2^n for f(n)<k<=f(n+1) a(k)=f(n+1)-a(k-f(n)) (b(n,2) using pari code).

+0
5

1, 1, 3, 3, 7, 7, 5, 5, 15, 15, 13, 13, 9, 9, 11, 11, 31, 31, 29, 29, 25, 25, 27, 27, 17, 17, 19, 19, 23, 23, 21, 21, 63, 63, 61, 61, 57, 57, 59, 59, 49, 49, 51, 51, 55, 55, 53, 53, 33, 33, 35, 35, 39, 39, 37, 37, 47, 47, 45, 45, 41, 41, 43, 43, 127, 127, 1, 25, 125, 121, 121, 123 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(2n-1)=a(2n)` `a(n)=2a(ceil(n/2))-1+2t(ceil(n/2)-1) where t(n)=A010060(n) is the Thue-Morse sequence`
	PROGRAM	`(PARI) b(n, m)=if(n<2, 1, m*m^floor(log(n-1)/log(m))-b(n-m^floor(log(n-1)/log(m)), m))`
	CROSSREFS	`Cf. A105669, A105672, A093347, A093348.` `Sequence in context: A000199 A161771 A160515 this_sequence A003817 A092474 A107470` `Adjacent sequences: A105667 A105668 A105669 this_sequence A105671 A105672 A105673`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 03 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research