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

A352342 Lazy-Pell-Niven numbers: numbers that are divisible by the sum of the digits in their maximal (or lazy) representation in terms of the Pell numbers (A352339).

Original entry on oeis.org

1, 2, 4, 9, 12, 15, 20, 24, 25, 28, 30, 35, 40, 48, 50, 54, 56, 60, 63, 64, 70, 72, 78, 84, 88, 91, 96, 102, 115, 120, 136, 144, 160, 162, 168, 180, 182, 184, 189, 207, 209, 210, 216, 217, 234, 246, 256, 261, 270, 304, 306, 308, 315, 320, 328, 333, 350, 352, 357
Offset: 1

Views

Author

Amiram Eldar, Mar 12 2022

Keywords

Comments

Numbers k such that A352340(k) | k.

Examples

			4 is a term since its maximal Pell representation, A352339(4) = 11, has the sum of digits A352340(4) = 1+1 = 2 and 4 is divisible by 2.
		

Crossrefs

Programs

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

A352343 Numbers k such that k and k+1 are both lazy-Pell-Niven numbers (A352342).

Original entry on oeis.org

1, 24, 63, 209, 216, 459, 560, 584, 656, 729, 999, 1110, 1269, 1728, 1859, 1989, 2100, 2196, 2197, 2255, 2650, 2651, 2820, 3443, 3497, 4080, 4563, 5291, 5784, 5785, 5837, 5928, 6252, 6383, 7344, 7657, 7812, 8150, 8203, 8459, 8670, 8749, 9251, 9295, 9372, 9464, 9840, 9884
Offset: 1

Views

Author

Amiram Eldar, Mar 12 2022

Keywords

Comments

Numbers k such that A352340(k) | k and A352340(k+1) | k+1.

Examples

			24 is a term since 24 and 25 are both lazy-Pell-Niven numbers: the maximal Pell representation of 24, A352339(24) = 1210, has the sum of digits A352340(24) = 1+2+1+0 = 4 and 24 is divisible by 4, and the maximal Pell representation of 25, A352339(25) = 1211, has the sum of digits A352340(25) = 1+2+1+1 = 5 and 25 is divisible by 5.
		

Crossrefs

Programs

  • Mathematica
    pell[1] = 1; pell[2] = 2; pell[n_] := pell[n] = 2*pell[n - 1] + pell[n - 2]; pellp[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[pell[k] <= m, k++]; k--; AppendTo[s, k]; m -= pell[k]; k = 1]; IntegerDigits[Total[3^(s - 1)], 3]]; lazyPellNivenQ[n_] := Module[{v = pellp[n]}, nv = Length[v]; i = 1; While[i <= nv - 2, If[v[[i]] > 0 && v[[i + 1]] == 0 && v[[i + 2]] < 2, v[[i ;; i + 2]] += {-1, 2, 1}; If[i > 2, i -= 3]]; i++]; i = Position[v, _?(# > 0 &)]; Divisible[n, Plus @@ v[[i[[1, 1]] ;; -1]]]]; Select[Range[10^4], lazyPellNivenQ[#] && lazyPellNivenQ[#+1] &]

A352344 Starts of runs of 3 consecutive lazy-Pell-Niven numbers (A352342).

Original entry on oeis.org

2196, 2650, 5784, 17459, 28950, 57134, 112878, 124506, 147078, 162809, 169694, 191538, 210494, 218654, 223344, 223459, 230894, 239360, 258740, 277455, 278900, 285615, 289695, 291328, 291858, 295408, 311524, 314658, 324734, 332894, 335179, 341900, 347718, 362880
Offset: 1

Views

Author

Amiram Eldar, Mar 12 2022

Keywords

Examples

			2196 is a term since 2196, 2197 and 2198 are all divisible by the sum of the digits in their maximal Pell representation:
     k  A352339(k)  A352340(k)  k/A352340(k)
  ----  ----------  ----------  ------------
  2196   121222020          12           183
  2197   121222021          13           169
  2198   121222022          14           157
		

Crossrefs

Subsequence of A352342 and A352343.
A352345 is a subsequence.

Programs

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

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
		

Crossrefs

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

Crossrefs

Subsequence of A364216, A364217 and A364218.
Subsequences: A364220, A364221.

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

Crossrefs

Subsequence of A364379, A364380 and A364381.
A364383 is a subsequence.

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?

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

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

Programs

  • Mathematica
    seq[3, 4] (* generates the first 3 terms using the function seq[count, nConsec] from A364007 *)
Showing 1-8 of 8 results.