id:A084217 - OEIS Search Results

Search: id:A084217

Displaying 1-1 of 1 results found.

page 1

Number of k's 1<=k<=n dividing the numerator of 2n-th Bernoulli number.

+0
2

1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 2, 1, 2, 2, 1, 2, 1, 2, 2, 4, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 1, 4, 2, 2, 2, 2, 3, 2, 1, 2, 2, 3, 2, 4, 1, 2, 2, 1, 2, 2, 1, 4, 2, 2, 3, 2, 1, 4, 2, 2, 2, 5, 1, 2, 3, 2, 1 (list; graph; listen)

	OFFSET	`1,4`
	PROGRAM	`(PARI) a(n)=sum(k=1, n, if(numerator(bernfrac(2*n))%k, 0, 1))`
	CROSSREFS	`Adjacent sequences: A084214 A084215 A084216 this_sequence A084218 A084219 A084220` `Sequence in context: A131017 A049046 A003647 this_sequence A025903 A101211 A081652`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 21 2003`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research