login
The OEIS is supported by the many generous donors 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; text; 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.
LINKS
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: A240225 A283893 A112427 * A346388 A128151 A071166
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 25 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:05 EDT 2024. Contains 371962 sequences. (Running on oeis4.)