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

A352107 Lazy-tribonacci-Niven numbers: numbers that are divisible by the number of terms in their maximal (or lazy) representation in terms of the tribonacci numbers (A352103).

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 18, 20, 21, 24, 28, 30, 33, 36, 39, 40, 48, 50, 56, 60, 68, 70, 72, 75, 76, 80, 90, 96, 100, 108, 115, 116, 120, 135, 136, 140, 150, 155, 156, 160, 162, 168, 175, 176, 177, 180, 184, 185, 188, 195, 198, 204, 205, 208, 215, 216, 225, 231, 260
Offset: 1

Views

Author

Amiram Eldar, Mar 05 2022

Keywords

Comments

Numbers k such that A352104(k) | k.

Examples

			6 is a term since its maximal tribonacci representation, A352103(6) = 110, has A352104(6) = 2 1's and 6 is divisible by 2.

Links

Crossrefs

Cf. A352103, A352104.
Subsequences: A352108, A352109, A352110.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089.

Programs

  • Mathematica
    t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; trib[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[t[k] <= m, k++]; k--; AppendTo[s, k]; m -= t[k]; k = 1]; IntegerDigits[Total[2^(s - 1)], 2]]; q[n_] := Module[{v = trib[n]}, nv = Length[v]; i = 1; While[i <= nv - 3, If[v[[i ;; i + 3]] == {1, 0, 0, 0}, v[[i ;; i + 3]] = {0, 1, 1, 1}; If[i > 3, i -= 4]]; i++]; i = Position[v, _?(# > 0 &)]; If[i == {}, False, Divisible[n, Total[v[[i[[1, 1]] ;; -1]]]]]]; Select[Range[300], q]

A352108 Numbers k such that k and k+1 are both lazy-tribonacci-Niven numbers (A352107).

Original entry on oeis.org

1, 20, 39, 75, 115, 135, 155, 175, 176, 184, 204, 215, 264, 567, 684, 704, 725, 791, 846, 872, 1089, 1104, 1115, 1134, 1183, 1184, 1211, 1224, 1407, 1575, 1840, 1880, 2064, 2075, 2151, 2191, 2232, 2259, 2260, 2415, 2529, 2583, 2624, 2780, 2820, 2848, 2888, 2988
Offset: 1

Views

Author

Amiram Eldar, Mar 05 2022

Keywords

Examples

			20 is a term since 20 and 21 are both lazy-tribonacci-Niven numbers: the maximal tribonacci representation of 20, A352103(20) = 10111, has 4 1's and 20 is divisible by 4, and the maximal tribonacci representation of 21, A352103(20) = 11001, has 3 1's and 21 is divisible by 3.

Links

Crossrefs

Cf. A352103, A352104.
Subsequence of A352107.
Subsequences: A352109, A352110.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720, A352090.

Programs

  • Mathematica
    t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; trib[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[t[k] <= m, k++]; k--; AppendTo[s, k]; m -= t[k]; k = 1]; IntegerDigits[Total[2^(s - 1)], 2]]; q[n_] := Module[{v = trib[n]}, nv = Length[v]; i = 1; While[i <= nv - 3, If[v[[i ;; i + 3]] == {1, 0, 0, 0}, v[[i ;; i + 3]] = {0, 1, 1, 1}; If[i > 3, i -= 4]]; i++]; i = Position[v, _?(# > 0 &)]; If[i == {}, False, Divisible[n, Total[v[[i[[1, 1]] ;; -1]]]]]]; Select[Range[3000], q[#] && q[# + 1] &]

A352109 Starts of runs of 3 consecutive lazy-tribonacci-Niven numbers (A352107).

Original entry on oeis.org

175, 1183, 2259, 5290, 12969, 21130, 51820, 70629, 78090, 79540, 81818, 129648, 160224, 169234, 180908, 228240, 238574, 249494, 278628, 332891, 376335, 383866, 398650, 399644, 454090, 550380, 565200, 683448, 683604, 694274, 728895, 754390, 782110, 809830, 837550
Offset: 1

Views

Author

Amiram Eldar, Mar 05 2022

Keywords

Examples

			175 is a term since 175, 176 and 177 are all divisible by the number of terms in their maximal tribonacci representation:
    k  A352103(k)  A352104(k)  k/A352104(k)
  ---  ----------  ----------  ------------
  175    11111110           7            25
  176    11111111           8            22
  177   100100100           3            59

Links

Crossrefs

Cf. A352103, A352104.
Subsequence of A352107 and A352108.
A352110 is a subsequence.
Similar sequences: A154701, A328206, A328210, A328214, A330932, A331087, A333428, A334310, A331822, A342428, A344343, A351716, A351721, A352091.

Programs

  • Mathematica
    t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; trib[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[t[k] <= m, k++]; k--; AppendTo[s, k]; m -= t[k]; k = 1]; IntegerDigits[Total[2^(s - 1)], 2]]; lazyTriboNivenQ[n_] := Module[{v = trib[n]}, nv = Length[v]; i = 1; While[i <= nv - 3, If[v[[i ;; i + 3]] == {1, 0, 0, 0}, v[[i ;; i + 3]] = {0, 1, 1, 1}; If[i > 3, i -= 4]]; i++]; i = Position[v, ?(# > 0 &)]; If[i == {}, False, Divisible[n, Total[v[[i[[1, 1]] ;; -1]]]]]]; seq[count, nConsec_] := Module[{tri = lazyTriboNivenQ /@ Range[nConsec], s = {}, c = 0, k = nConsec + 1}, While[c < count, If[And @@ tri, c++; AppendTo[s, k - nConsec]]; tri = Join[Rest[tri], {lazyTriboNivenQ[k]}]; k++]; s]; seq[30, 3]

A352345 Starts of runs of 4 consecutive lazy-Pell-Niven numbers (A352342).

Original entry on oeis.org

750139, 41765247, 54831951, 56423275, 136038447, 151175724, 223956843, 227483124, 293913170, 362557214, 382572475, 457616575, 502106253, 562407324, 586380624, 637133390, 724382239, 771849439, 774421478, 859463253, 926398647, 953750523, 1043787390, 1193063550
Offset: 1

Views

Author

Amiram Eldar, Mar 12 2022

Keywords

Comments

Conjecture: There are no runs of 5 consecutive lazy-Pell-Niven numbers (checked up to 10^9).

Examples

			750139 is a term since 750139, 750140, 750141 and 750142 are all divisible by the sum of the digits in their maximal Pell representation:
       k        A352339(k)  A352340(k)  k/A352340(k)
  ------  ----------------  ---------   -----------
  750139  1102022021112220         19         39481
  750140  1102022021112221         20         37507
  750141  1102022021112222         21         35721
  750142  1102022021120210         17         44126

Crossrefs

Cf. A352339, A352340.
Subsequence of A352342, A352343 and A352344.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110.

A352511 Starts of runs of 4 consecutive Catalan-Niven numbers (A352508).

Original entry on oeis.org

144, 15630, 164862, 202761, 373788, 450189, 753183, 1403961, 1779105, 2588415, 2673774, 2814229, 2850880, 3009174, 3013722, 3045870, 3091023, 3702390, 3942519, 4042950, 4432128, 4725432, 4938348, 5718942, 5907312, 6268248, 6519615, 6592752, 6791379, 7095492, 8567802
Offset: 1

Views

Author

Amiram Eldar, Mar 19 2022

Keywords

Comments

Conjecture: There are no runs of 5 consecutive Catalan-Niven numbers (checked up to 10^9).

Examples

			144 is a term since 144, 145, 146 and 147 are all divisible by the sum of the digits in their Catalan representation:
    k  A014418(k)  A014420(k)  k/A014420(k)
  ---  ----------  ----------  ------------
  144      100210           4            36
  145      100211           5            29
  146      101000           2            73
  147      101001           3            49

Links

Crossrefs

Cf. A000108, A014418, A014420.
Subsequence of A352508, A352509 and A352510.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110, A352345.

Programs

  • Mathematica
    c[n_] := c[n] = CatalanNumber[n]; catNivQ[n_] := Module[{s = {}, m = n, i}, While[m > 0, i = 1; While[c[i] <= m, i++]; i--; m -= c[i]; AppendTo[s, i]]; Divisible[n, Plus @@ IntegerDigits[Total[4^(s - 1)], 4]]]; seq[count_, nConsec_] := Module[{cn = catNivQ /@ Range[nConsec], s = {}, c = 0, k = nConsec + 1}, While[c < count, If[And @@ cn, c++; AppendTo[s, k - nConsec]]; cn = Join[Rest[cn], {catNivQ[k]}]; k++]; s]; seq[5, 4]

A364219 Starts of runs of 4 consecutive integers that are Jacobsthal-Niven numbers (A364216).

Original entry on oeis.org

1, 42, 43, 2731, 11605, 13024, 14229, 25983, 39390, 45727, 46624, 47529, 60073, 96039, 111390, 131103, 132010, 133984, 134430, 140767, 148180, 148181, 148509, 174762, 174763, 187744, 197790, 237609, 247114, 266453, 275229, 287988, 312190, 330847, 354429, 370269
Offset: 1

Views

Author

Amiram Eldar, Jul 14 2023

Keywords

Links

Crossrefs

Subsequence of A364216, A364217 and A364218.
Subsequences: A364220, A364221.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110, A352345, A352511.

Programs

  • Mathematica
    consecJacobsthalNiven[4*10^5, 4] (* using the function from A364217 *)
  • PARI
    lista(4*10^5, 4) \\ using the function from A364217

A364382 Starts of runs of 4 consecutive integers that are greedy Jacobsthal-Niven numbers (A364379).

Original entry on oeis.org

1, 2, 3, 8, 9, 42, 43, 84, 85, 2730, 2731, 5460, 5461, 21864, 21865, 59477, 60073, 66303, 75048, 112509, 156607, 174762, 174763, 283327, 312190, 320768, 349524, 349525, 351570, 354429, 374589, 384039, 479037, 504510, 527103, 624040, 625470, 656829, 688830, 711423
Offset: 1

Views

Author

Amiram Eldar, Jul 21 2023

Keywords

Links

Crossrefs

Cf. A265745, A265747.
Subsequence of A364379, A364380 and A364381.
A364383 is a subsequence.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110, A352345, A352511, A364219.

Programs

  • Mathematica
    consecGreedyJN[72000, 4] (* using the function consecGreedyJN from A364380 *)
  • PARI
    lista(10^5, 4) \\ using the function lista from A364380

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?

Links

Crossrefs

Subsequence of A364123, A364124 and A364125.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110, A352345, A352511.

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

A364009 Starts of runs of 4 consecutive integers that are Wythoff-Niven numbers (A364006).

Original entry on oeis.org

374, 978, 17708, 832037, 1631097, 4821894, 5572377, 13376142, 14808759, 14930343, 35406720, 36534357, 38208519, 38748444, 38890509, 39088166, 65375232, 70046899, 79988116, 81224637, 82071105, 82898100, 94109430, 94875417, 95070492, 98014500, 100350522, 101651787, 102190437
Offset: 1

Views

Author

Amiram Eldar, Jul 01 2023

Keywords

Comments

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

Crossrefs

Subsequence of A364006, A364007 and A364008.
Similar sequences: A141769, A328211, A328207, A328215, A330933, A331824, A334311, A342429, A344344, A352092, A352110, A352345, A352511.

Programs

  • Mathematica
    seq[3, 4] (* generates the first 3 terms using the function seq[count, nConsec] from A364007 *)
Showing 1-9 of 9 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.