id:A098229 - OEIS Search Results

Search: id:A098229

Displaying 1-1 of 1 results found.

page 1

a(n)=6*c(n,1) where n runs through the 3-smooth numbers (see comment).

+0
1

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

	OFFSET	`1,2`
	COMMENT	`If n is a 3-smooth number, (i.e. of form 2^i3^j for i,j>=0) the value c(n,k)={(n^(2k)-1)B(2k)} is independent of k where {x} denotes the fractional part of x and B(k) is the k-th Bernoulli's number.`
	FORMULA	`a(1)=0; for k>0, a(2^k)=3 a(3^k)=2; for i>0 and j>0 a(2^i*3^j)=5`
	PROGRAM	`(PARI) m=7; for(n=1, 1000000, if(gcd(n, 6^100)==n, print1(6frac((n^(2m)-1)bernfrac(2m)), ", ")))`
	CROSSREFS	`Cf. A003586.` `Adjacent sequences: A098226 A098227 A098228 this_sequence A098230 A098231 A098232` `Sequence in context: A064885 A029618 A112427 this_sequence A128151 A071166 A140358`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research