A377272
Numbers k such that k and k+1 are both terms in A377210.
Original entry on oeis.org
1, 2, 3, 4, 5, 12, 47375, 2310399, 3525200, 6506367, 9388224, 17613504, 29373839, 41534800, 48191759, 48344120, 66927384, 68094999, 71982999, 92547279, 95497919, 110146959, 110395439, 126123920, 148865535, 152546030, 154451583, 171570069, 193628799, 232058519
Offset: 1
47375 is a term since both 47375 and 47376 are in A377210: 47375/A007895(47375) = 9475, 9475/A007895(9475) = 1895 and 1895/A007895(1895) = 379 are integers, and 47376/A007895(47376) = 15792, 15792/A007895(15792) = 3948 and 3948/A007895(3948) = 1316 are integers.
-
zeck[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5]*# + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]]; (* Alonso del Arte at A007895 *)
q[k_] := q[k] = Module[{z = zeck[k], z2, m, n}, IntegerQ[m = k/z] && Divisible[m, z2 = zeck[m]] && Divisible[n = m/z2, zeck[n]]]; Select[Range[50000], q[#] && q[#+1] &]
-
zeck(n) = if(n<4, n>0, my(k=2, s, t); while(fibonacci(k++)<=n, ); while(k && n, t=fibonacci(k); if(t<=n, n-=t; s++); k--); s); \\ Charles R Greathouse IV at A007895
is1(k) = {my(z = zeck(k), z2, m); if(k % z, return(0)); m = k/z; z2 = zeck(m); !(m % z2) && !((m/z2) % zeck(m/z2)); }
lista(kmax) = {my(q1 = is1(1), q2); for(k = 2, kmax, q2 = is1(k); if(q1 && q2, print1(k-1, ", ")); q1 = q2); }
A377455
Numbers k such that k and k+1 are both terms in A377385.
Original entry on oeis.org
1, 1224, 126191, 428519, 649727, 1015416, 1988064, 3425856, 4542740, 4574240, 4743900, 4813668, 5131008, 6899840, 7001315, 7172424, 7356096, 8020583, 10206000, 11146421, 11566800, 11597999, 11693807, 12556700, 13742624, 13745759, 13831487, 14365120, 16939799, 20561400
Offset: 1
1224 is a term since both 1224 and 1225 are in A377385: 1224/A034968(1224) = 204 and 204/A034968(204) = 34 are integers, and 1225/A034968(1225) = 175 and 175/A034968(175) = 35 are integers.
-
fdigsum[n_] := Module[{k = n, m = 2, r, s = 0}, While[{k, r} = QuotientRemainder[k, m]; k != 0 || r != 0, s += r; m++]; s]; q[k_] := q[k] = Module[{f = fdigsum[k]}, Divisible[k, f] && Divisible[k/f, fdigsum[k/f]]]; Select[Range[2*10^6], q[#] && q[#+1] &]
-
fdigsum(n) = {my(k = n, m = 2, r, s = 0); while([k, r] = divrem(k, m); k != 0 || r != 0, s += r; m++); s;}
is1(k) = {my(f = fdigsum(k)); !(k % f) && !((k/f) % fdigsum(k/f));}
lista(kmax) = {my(q1 = is1(1), q2); for(k = 2, kmax, q2 = is1(k); if(q1 && q2, print1(k-1, ", ")); q1 = q2);}
A377273
Starts of runs of 3 consecutive integers that are terms in A377209.
Original entry on oeis.org
1, 2, 3, 4, 231700599, 1069467839, 1156703470, 1241186868, 2533742848, 2684864798, 3037193808, 5056780650, 7073145000, 7557047134, 9623855878, 12090760318, 12120887700, 13816479742, 14430478270, 15811947072, 16864260048, 20905152190, 22735441078, 23224253128, 23269229774, 23766221400, 25175490262
Offset: 1
231700599 is a term since 231700599, 231700600 and 231700601 are all terms in A377209: 231700599/A007895(231700599) = 17823123 and 17823123/A007895(17823123) = 1980347 are integers, 231700600/A007895(231700600) = 23170060 and 23170060/A007895(23170060) = 2317006 are integers, and 231700601/A007895(231700601) = 21063691 and 21063691/A007895(21063691) = 1914881 are integers.
-
zeck(n) = if(n<4, n>0, my(k=2, s, t); while(fibonacci(k++)<=n, ); while(k && n, t=fibonacci(k); if(t<=n, n-=t; s++); k--); s); \\ Charles R Greathouse IV at A007895
is1(k) = {my(z = zeck(k)); !(k % z) && !((k/z) % zeck(k/z)); }
lista(kmax) = {my(q1 = is1(1), q2 = is1(2), q3); for(k = 3, kmax, q3 = is1(k); if(q1 && q2 && q3, print1(k-2, ", ")); q1 = q2; q2 = q3);}
Showing 1-3 of 3 results.