id:A086421 - OEIS Search Results

Search: id:A086421

Displaying 1-1 of 1 results found.

page 1

Smallest k>=0 such that 2^(n-k) divides S(m,n) for all m>0 where S(m,n)=sum(i=0,m, i^n*C(m,i)).

+0
1

0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 3, 2 (list; graph; listen)

	OFFSET	`0,4`
	FORMULA	`It seems that a(2^j)=1, j>=0`
	CROSSREFS	`Cf. A001787, A001788, A058645, A058649.` `Adjacent sequences: A086418 A086419 A086420 this_sequence A086422 A086423 A086424` `Sequence in context: A105102 A105105 A054717 this_sequence A109400 A000374 A120562`
	KEYWORD	`more,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 07 2003`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.