login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249909 Smallest prime factor of A241601(n), or 1 if A241601(n) = 1. 3
1, 1, 1, 1, 1, 1, 1, 61, 1, 277, 1, 19, 691, 43, 1, 47, 3617, 228135437, 43867, 79, 283, 41737, 131, 31, 103, 2137, 657931, 67, 9349, 71, 1721, 15669721, 37, 930157, 151628697551, 4153, 26315271553053477373, 9257, 154210205991661, 23489580527043108252017828576198947741, 137616929, 763601 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

COMMENTS

Also the smallest prime factor of A246006(n) that is >= n+2.

a(n) = A020639(A241601(n)).

a(n) = 1 iff n is in the set {0, 1, 2, 3, 4, 5, 6, 8, 10, 14}.

a(189) is currently unknown; a(190)..a(199) = {5101, 559570609330768709, 40833790860803270336710504624737304862569304959957, 311, 467, 34110029, 461, 26034939865747697437451558982836040663625026070193, 34470847, 1879}.

All terms are Bernoulli or Euler irregular primes.

LINKS

Eric Chen, Table of n, a(n) for n = 0..188

Samuel Wagstaff, Factorization of Bernoulli and Euler numbers

MATHEMATICA

a246006[n_] := If[EvenQ[n], Abs[Numerator[BernoulliB[n]]], Abs[EulerE[n-1]]];

a241601[n_] := a246006[n]/GCD[a246006[n], n!]

a = {}; Do[a = Append[a, FactorInteger[a241601[n]][[1, 1]]], {n, 0, 99} ]; a

CROSSREFS

Sequence in context: A065247 A058930 A333523 * A241601 A132096 A051322

Adjacent sequences:  A249906 A249907 A249908 * A249910 A249911 A249912

KEYWORD

nonn

AUTHOR

Eric Chen, Dec 15 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 23:52 EDT 2021. Contains 343156 sequences. (Running on oeis4.)