id:A122698 - OEIS Search Results

Search: id:A122698

Displaying 1-1 of 1 results found.

page 1

a(1)=a(2)=1 then a(n)=sum_{d|n, 1<d<n} a(d)*a(n/d).

+0
1

1, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,8`
	FORMULA	`a(1)=1, for k>=0 a(2^(k+1))= A000108(k) and if n>1 is not a power of 2 a(n)=0`
	PROGRAM	`(PARI) a(n)=if(n<3, 1, sumdiv(n, d, if((d-1)(d-n), a(d)a(n/d), 0)))`
	CROSSREFS	`Sequence in context: A104261 A028702 A083929 this_sequence A002483 A060478 A088806` `Adjacent sequences: A122695 A122696 A122697 this_sequence A122699 A122700 A122701`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (abmt(AT)orange.fr), Sep 22 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research