login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098229 a(n)=6*c(n,1) where n runs through the 3-smooth numbers (see comment). 0
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

If n is a 3-smooth number, (i.e. of form 2^i*3^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

PROG

(PARI) m=7; for(n=1, 1000000, if(gcd(n, 6^100)==n, print1(6*frac((n^(2*m)-1)*bernfrac(2*m)), ", ")))

CROSSREFS

Cf. A003586.

Sequence in context: A064885 A029618 A112427 * A128151 A071166 A140358

Adjacent sequences:  A098226 A098227 A098228 * A098230 A098231 A098232

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:02 EST 2012. Contains 205570 sequences.