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!)
A060398 Values of k associated with A060397. 5
1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 4, 1, 0, 3, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 0, 4, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 3, 1, 0, 2, 1, 0, 1, 1, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,15
LINKS
Carlos Rivera, Conjecture 17. The Ludovicus conjecture about the Euler trinomials, The Prime Puzzles & Problems Connection.
MATHEMATICA
a[n_] := Switch[n, 0, 1, _, Module[{f, kmax0 = 2}, f[kmax_] := f[kmax] = MinimalBy[Table[{k, FactorInteger[k^2 + k + 2 n + 1][[1, 1]]}, {k, 0, kmax}], Last, 1]; f[kmax = kmax0]; f[kmax = 2 kmax]; While[f[kmax] != f[kmax/2], kmax = 2 kmax]; f[kmax][[1, 1]]]];
Table[a[n], {n, 0, 105}] (* Jean-François Alcover, Aug 15 2022 *)
CROSSREFS
Cf. A060397.
Sequence in context: A086017 A350532 A000161 * A253242 A359814 A359815
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 04 2001
EXTENSIONS
More terms from T. D. Noe, Mar 12 2007
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 15 13:23 EDT 2024. Contains 372540 sequences. (Running on oeis4.)