The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A219543 Denominators of Bernoulli numbers which are congruent to 3 (mod 9). 1
30, 66, 138, 282, 354, 498, 642, 1002, 1074, 1362, 1434, 1578, 2082, 2154, 2298, 2478, 2658, 2730, 2802, 2874, 3018, 3378, 3486, 3522, 3882, 3954, 4314, 4494, 4962, 5034, 5178, 5322, 5898, 6114, 7122, 7338, 7518, 7554, 7590, 7698, 7842, 7914, 8202, 8634, 8922 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The sequence contains the elements of A090801 which are == 3 (mod 9).
Conjecture: all the first differences 36, 72, 144, 72,... of the sequence are multiples of 36.
The conjecture is true, since elements of A090801 are 2 mod 4. - Charles R Greathouse IV, Nov 22 2012
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
listLength = 50; n0 = 10*listLength; Clear[f]; f[n_] := f[n] = Union[Reap[ For[k = 4, k <= n, k = k+2, b = Denominator[BernoulliB[k]]; If[Mod[b, 36] == 30, Sow[b]]]][[2, 1]]][[1 ;; listLength]]; f[n0]; f[n = 2 n0]; While[ Print["n = ", n]; f[n] != f[n/2], n = 2 n]; A219543 = f[n] (* Jean-François Alcover, Jan 11 2016 *)
PROG
(PARI) is(n)=if(n%36-30, 0, my(f=factor(n)); if(vecmax(f[, 2])>1, return(0)); fordiv(lcm(apply(k->k-1, f[, 1])), k, if(isprime(k+1) && n%(k+1), return(0))); 1) \\ Charles R Greathouse IV, Nov 26 2012
CROSSREFS
Second subset of the Bernoulli denominators A090801. The first is A218755.
Sequence in context: A209876 A290145 A157346 * A309393 A154055 A270758
KEYWORD
nonn
AUTHOR
Paul Curtz, Nov 22 2012
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 May 16 15:45 EDT 2024. Contains 372554 sequences. (Running on oeis4.)