cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A377271 Numbers k such that k and k+1 are both terms in A377209.

Original entry on oeis.org

1, 2, 3, 4, 5, 12, 89, 1824, 3024, 7024, 15084, 17184, 18935, 22624, 28657, 29424, 31464, 37024, 38835, 40032, 42679, 44975, 47375, 66744, 66815, 78219, 89495, 107456, 112175, 119744, 144599, 148519, 169883, 171941, 172025, 188208, 207935, 226624, 244404, 248255
Offset: 1

Views

Author

Amiram Eldar, Oct 22 2024

Keywords

Examples

			1824 is a term since both 1824 and 1825 are in A377209: 1824/A007895(1824) = 304 and 304/A007895(304) = 76 are integers, and 1825/A007895(1825) = 365 and 365/A007895(365) = 73 are integers.

Links

Crossrefs

Cf. A007895, A376793 (binary analog).
Subsequence of A328208, A328209 and A377209.
Subsequences: A377272, A377273.

Programs

  • Mathematica
    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]}, Divisible[k, z] && Divisible[k/z, zeck[k/z]]]; Select[Range[250000], q[#] && q[#+1] &]
  • PARI
    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); 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

Views

Author

Amiram Eldar, Oct 22 2024

Keywords

Examples

			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.

Crossrefs

Cf. A007895, A376794 (binary analog).
Subsequence of A328208, A328209, A328210, A377209 and A377271.

Programs

  • PARI
    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);}

A377385 Factorial-base Niven numbers (A118363) k such that k/f(k) is also a factorial-base Niven number, where f(k) = A034968(k) is the sum of digits in the factorial-base representation of k.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 18, 24, 27, 36, 40, 48, 54, 72, 80, 96, 108, 120, 135, 144, 168, 175, 180, 192, 208, 210, 240, 280, 288, 336, 360, 384, 420, 432, 468, 480, 490, 572, 576, 594, 600, 630, 720, 732, 740, 750, 780, 784, 819, 840, 846, 861, 864, 888, 900, 924, 936, 945, 980, 984
Offset: 1

Views

Author

Amiram Eldar, Oct 27 2024

Keywords

Examples

			8 is a term since 8/f(8) = 4 is an integer and also 4/f(4) = 2 is an integer.

Links

Crossrefs

Subsequence of A118363.
Subsequences: A000142, A377386.
Cf. A034968, A377384.
Analogous sequences: A376616 (binary), A377209 (Zeckendorf).

Programs

  • Mathematica
    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_] := Module[{f = fdigsum[k]}, Divisible[k, f] && Divisible[k/f, fdigsum[k/f]]]; Select[Range[1000], q]
  • PARI
    fdigsum(n) = {my(k = n, m = 2, r, s = 0); while([k, r] = divrem(k, m); k != 0 || r != 0, s += r; m++); s;}
is(k) = {my(f = fdigsum(k)); !(k % f) && !((k/f) % fdigsum(k/f));}

A377210 Zeckendorf-Niven numbers (A328208) k such that m = k/z(k) and m/z(m) are also Zeckendorf-Niven numbers, where z(k) = A007895(k) is the number of terms in the Zeckendorf representation of k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 16, 21, 24, 26, 30, 34, 42, 48, 55, 60, 68, 78, 89, 110, 120, 126, 144, 178, 180, 192, 204, 233, 243, 264, 270, 288, 300, 312, 324, 330, 360, 377, 466, 480, 534, 540, 576, 600, 610, 621, 672, 720, 754, 768, 864, 987, 1020, 1056
Offset: 1

Views

Author

Amiram Eldar, Oct 20 2024

Keywords

Examples

			24 is a term since 24/z(24) = 12, 12/z(12) = 4 and 4/z(4) = 2 are all integers.

Links

Crossrefs

Cf. A000045 (a subsequence), A007895, A376617 (binary analog).
Subsequence of A328208 and A377209.

Programs

  • Mathematica
    zeck[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5]*# + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]]; (* Alonso del Arte at A007895 *)
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[1000], q]
  • PARI
    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
is(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)); }

A377208 a(n) is the number of iterations that n requires to reach a noninteger or a Fibonacci number under the map x -> x / z(x), where z(k) = A007895(k) is the number of terms in the Zeckendorf representation of k; a(n) = 0 if n is a Fibonacci number.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 2, 0, 2, 1, 1, 1, 2, 1, 1, 0, 2, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 1, 0, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 2, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 0, 3, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1
Offset: 1

Views

Author

Amiram Eldar, Oct 20 2024

Keywords

Comments

The Fibonacci numbers are the fixed points of the map, since z(Fibonacci(k)) = 1 for all k >= 1. Therefore they are arbitrarily assigned the value a(Fibonacci(k)) = 0.
Each number n starts a chain of a(n) integers: n, n/z(n), (n/z(n))/z(n/z(n)), ..., of them the first a(n)-1 integers are Zeckendorf-Niven numbers (A328208).

Examples

			a(12) = 2 since 12/z(12) = 4 and 4/z(4) = 2 is a Fibonacci number that is reached after 2 iterations.
a(36) = 3 since 36/z(36) = 18, 18/z(18) = 9 and 9/z(9) = 9/2 is a noninteger that is reached after 3 iterations.

Links

Crossrefs

Cf. A000005, A000045, A007895, A328208, A376615 (binary analog), A377209, A377210.

Programs

  • Mathematica
    zeck[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5]*# + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]]; (* Alonso del Arte at A007895 *)
a[n_] := a[n] = Module[{z = zeck[n]}, If[z == 1, 0, If[!Divisible[n, z], 1, 1 + a[n/z]]]]; Array[a, 100]
  • PARI
    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
a(n) = {my(z = zeck(n)); if(z == 1, 0, if(n % z, 1, 1 + a(n/z)));}

Formula

a(n) = 0 if and only if n is in A000045 (by definition).
a(n) >= 2 if and only if n is in A328208 \ A000079 (i.e., n is a Zeckendorf-Niven number that is not a Fibonacci number).
a(n) >= 3 if and only if n is in A377209 \ A000079.
a(n) >= 4 if and only if n is in A377210 \ A000079.
a(n) < A000005(n).
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.