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!)
A328214 Starts of runs of 3 consecutive lazy-Fibonacci-Niven numbers (A328212). 23
27312, 37504, 48060, 83248, 198254, 269856, 319694, 386136, 423520, 434300, 518175, 525672, 539800, 572184, 690858, 701118, 793799, 886534, 998866, 1015035, 1258444, 1396582, 1409058, 1511600, 1557422, 1680378, 1729398, 1753818, 2044768, 2136263, 2310624, 2396438, 2421024 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Helen G. Grundman, Consecutive Zeckendorf-Niven and lazy-Fibonacci-Niven numbers, Fibonacci Quarterly, Vol. 45, No. 3 (2007), pp. 272-276.
EXAMPLE
27312 is in the sequence since 27312, 27313 and 27314 are in A328212: A112310(27312) = 16 is a divisor of 27312, A112310(27312) = 13 is a divisor of 27313, and A112310(27314) = 14 is a divisor of 27314.
MATHEMATICA
ooQ[n_] := Module[{k = n}, While[k > 3, If[Divisible[k, 4], Return[True], k = Quotient[k, 2]]]; False]; c = 0; cn = 0; k = 1; s = {}; v = Table[-1, {3}]; While[cn < 33, If[! ooQ[k], c++; d = Total@IntegerDigits[k, 2]; If[Divisible[c, d], v = Join[Rest[v], {c}]; If[AllTrue[Differences[v], # == 1 &], cn++; AppendTo[s, c - 2]]]]; k++]; s
CROSSREFS
Sequence in context: A267706 A237381 A109481 * A234686 A064967 A168215
KEYWORD
nonn
AUTHOR
Amiram Eldar, Oct 07 2019
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 18 00:50 EDT 2024. Contains 372608 sequences. (Running on oeis4.)