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!)
A328213 Numbers m such that m and m+1 are consecutive lazy-Fibonacci-Niven numbers (A328212). 11

%I

%S 1,15,35,369,549,710,890,1089,1989,2196,2629,2951,3311,3679,3684,4927,

%T 5268,5291,5488,5603,5775,5819,5928,5940,6524,7072,7364,7403,7475,

%U 7500,7657,7812,8567,9254,9360,9372,9383,9477,9841,10205,10304,10360,11816,13299,13454

%N Numbers m such that m and m+1 are consecutive lazy-Fibonacci-Niven numbers (A328212).

%H Helen G. Grundman, <a href="https://www.fq.math.ca/Papers1/45-3/grundman.pdf">Consecutive Zeckendorf-Niven and lazy-Fibonacci-Niven numbers</a>, Fibonacci Quarterly, Vol. 45, No. 3 (2007), pp. 272-276.

%e 15 is in the sequence since both 15 and 16 are in A328212: A112310(15) = 3 is a divisor of 15, and A112310(16) = 4 is a divisor of 16.

%t 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, {2}]; While[cn < 45, 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 - 1]]]]; k++]; s

%Y Cf. A112310, A328212.

%K nonn

%O 1,2

%A _Amiram Eldar_, Oct 07 2019

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 September 18 09:05 EDT 2021. Contains 347518 sequences. (Running on oeis4.)