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-3 of 3 results.

A364123 Stolarsky-Niven numbers: numbers that are divisible by the number of 1's in their Stolarsky representation (A364121).

Original entry on oeis.org

2, 4, 6, 8, 9, 12, 14, 16, 20, 22, 24, 27, 30, 36, 38, 40, 42, 44, 48, 54, 56, 57, 60, 65, 69, 72, 75, 80, 84, 85, 90, 92, 96, 98, 100, 102, 104, 108, 112, 116, 120, 124, 126, 132, 136, 138, 145, 147, 150, 153, 155, 159, 160, 175, 180, 185, 190, 195, 196, 205
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2023

Keywords

Comments

Numbers k such that A200649(k) | k.
Fibonacci(k) + 1 is a term if k !== 3 (mod 6) (i.e., k is in A047263).

Examples

			4 is a term since its Stolarsky representation, A364121(4) = 10, has one 1 and 4 is divisible by 1.
6 is a term since its Stolarsky representation, A364121(6) = 101, has 2 1's and 6 is divisible by 2.
		

Crossrefs

Programs

  • Mathematica
    stol[n_] := stol[n] = If[n == 1, {}, If[n != Round[Round[n/GoldenRatio]*GoldenRatio], Join[stol[Floor[n/GoldenRatio^2] + 1], {0}], Join[stol[Round[n/GoldenRatio]], {1}]]];
    stolNivQ[n_] := n > 1 && Divisible[n, Total[stol[n]]];
    Select[Range[200], stolNivQ]
  • PARI
    stol(n) = {my(phi=quadgen(5)); if(n==1, [], if(n != round(round(n/phi)*phi), concat(stol(floor(n/phi^2) + 1), [0]), concat(stol(round(n/phi)), [1])));}
    isA364123(n) = n > 1 && !(n % vecsum(stol(n)));

A364125 Starts of runs of 3 consecutive integers that are Stolarsky-Niven numbers (A364123).

Original entry on oeis.org

1419, 2680, 6984, 18765, 20383, 28390, 48697, 55560, 69056, 121913, 125340, 125341, 125739, 133614, 135189, 136409, 140789, 147563, 150138, 155518, 157068, 171819, 317933, 318188, 319395, 323685, 339723, 340846, 349326, 356290, 371041, 389010, 392903, 393809, 400608
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2023

Keywords

Crossrefs

Programs

  • Mathematica
    seq[10, 3] (* generates the first 10 terms, using the function seq[count, nConsec] from A364124 *)
  • PARI
    lista(10, 3) \\ generates the first 10 terms, using the function lista(count, nConsec) from A364124

A364126 Starts of runs of 4 consecutive integers that are Stolarsky-Niven numbers (A364123).

Original entry on oeis.org

125340, 945591, 14998632, 16160505, 19304934, 42053801, 42064137, 46049955, 57180537, 103562368, 108489885, 122495982, 135562299, 139343337, 147991452, 164002374, 271566942, 296019657, 301748706, 310980030, 314537247, 316725570, 333478935, 336959907, 349815255
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2023

Keywords

Comments

Are there runs of 5 or more consecutive integers that are Stolarsky-Niven numbers?

Crossrefs

Programs

  • Mathematica
    seq[2, 4] (* generates the first 2 terms, using the function seq[count, nConsec] from A364124 *)
  • PARI
    lista(2, 4) \\ generates the first 2 terms, using the function lista(count, nConsec) from A364124
Showing 1-3 of 3 results.