A330927 -id:A330927 - cp's OEIS frontend

A351720 Numbers k such that k and k + 1 are both lazy-Lucas-Niven numbers (A351719).

1, 175, 216, 399, 656, 729, 737, 759, 1000, 1991, 2716, 2820, 2925, 3970, 4068, 4224, 4499, 4641, 5316, 5819, 6565, 6720, 6902, 7890, 9840, 10751, 11843, 12194, 12614, 13034, 13272, 14909, 15483, 15495, 16029, 17234, 17444, 17731, 18074, 18885, 19305, 19669, 20188

Offset: 1

Amiram Eldar, Feb 17 2022

			175 is a term since 175 and 176 are both lazy-Lucas-Niven numbers: the maximal Lucas representation of 175, A130311(175) = 1110110101, has 7 1's and 175 is divisible by 5, and the maximal Lucas representation of 176, A130311(7) = 1110110111, has 8 1's and 176 is divisible by 8.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000032, A130311, A131343.
Subsequence of A351719.
A351721 is a subsequence.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715.

lazy = Select[IntegerDigits[Range[10^6], 2], SequenceCount[#, {0, 0}] == 0 &]; t = Total[#*Reverse@LucasL[Range[0, Length[#] - 1]]] & /@ lazy; s = FromDigits /@ lazy[[TakeWhile[Flatten[FirstPosition[t, #] & /@ Range[Max[t]]], NumberQ]]]; SequencePosition[Divisible[Range[Length[s]], Plus @@@ IntegerDigits[s]], {True, True}][[;; , 1]]

A351715 Numbers k such that k and k + 1 are both Lucas-Niven numbers (A351714).

Original entry on oeis.org

1, 2, 3, 6, 7, 10, 11, 29, 39, 47, 57, 80, 123, 129, 134, 152, 159, 170, 176, 199, 206, 245, 279, 326, 384, 387, 398, 404, 521, 531, 543, 560, 579, 615, 644, 651, 684, 755, 843, 849, 854, 872, 879, 890, 896, 944, 1024, 1052, 1064, 1070, 1071, 1095, 1350, 1382

Offset: 1

Amiram Eldar, Feb 17 2022

			6 is a term since 6 and 7 are both Lucas-Niven numbers: the minimal Lucas representation of 6, A130310(6) = 1001, has 2 1's and 6 is divisible by 2, and the minimal Lucas representation of 7, A130310(7) = 10000, has one 1 and 7 is divisible by 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Subsequence of A351714.
A351716 is a subsequence.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351720.

lucasNivenQ[n_] := Module[{s = {}, m = n, k = 1}, While[m > 0, If[m == 1, k = 1; AppendTo[s, k]; m = 0, If[m == 2, k = 0; AppendTo[s, k]; m = 0, While[LucasL[k] <= m, k++]; k--; AppendTo[s, k]; m -= LucasL[k]; k = 1]]]; Divisible[n, Plus @@ IntegerDigits[Total[2^s], 2]]]; Select[Range[1400], And @@ lucasNivenQ/@{#, #+1} &]

A352090 Numbers k such that k and k+1 are both tribonacci-Niven numbers (A352089).

Original entry on oeis.org

1, 6, 7, 12, 13, 20, 26, 27, 39, 68, 75, 80, 81, 87, 115, 128, 135, 149, 176, 184, 185, 195, 204, 215, 224, 230, 236, 243, 264, 278, 284, 291, 344, 364, 399, 447, 506, 507, 519, 548, 555, 560, 575, 595, 615, 635, 656, 664, 665, 684, 704, 725, 744, 777, 804, 824

Offset: 1

Amiram Eldar, Mar 04 2022

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

The odd tribonacci numbers, A000073(A042964(m)), are all terms.

			6 is a term since 6 and 7 are both tribonacci-Niven numbers: the minimal tribonacci representation of 6, A278038(6) = 110, has 2 1's and 6 is divisible by 2, and the minimal tribonacci representation of 7, A278038(7) = 1000, has one 1 and 7 is divisible by 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000073, A042964, A278038, A278043.
Subsequence of A352089.
Subsequences: A352091, A352092.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720.

t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; q[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]; Divisible[n, DigitCount[Total[2^(s - 1)], 2, 1]]]; Select[Range[1000], q[#] && q[# + 1] &]

A330928 Starts of runs of 5 consecutive Niven (or harshad) numbers (A005349).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 131052, 491424, 1275140, 1310412, 1474224, 1614623, 1912700, 2031132, 2142014, 2457024, 2550260, 3229223, 3931224, 4422624, 4914024, 5405424, 5654912, 5920222, 7013180, 7125325, 7371024, 8073023, 8347710, 9424832, 10000095, 10000096, 10000097

Offset: 1

Amiram Eldar, Jan 03 2020

Cooper and Kennedy proved that there are infinitely many runs of 20 consecutive Niven numbers. Therefore this sequence is infinite.

			131052 is a term since 131052 is divisible by 1 + 3 + 1 + 0 + 5 + 2 = 12, 131053 is divisible by 13, 131054 is divisible by 14, 131055 is divisible by 15, and 131056 is divisible by 16.

Jean-Marie De Koninck, Those Fascinating Numbers, American Mathematical Society, 2009, p. 36, entry 110.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Curtis Cooper and Robert E. Kennedy, On consecutive Niven numbers, Fibonacci Quarterly, Vol. 21, No. 2 (1993), pp. 146-151.
Helen G. Grundman, Sequences of consecutive Niven numbers, Fibonacci Quarterly, Vol. 32, No. 2 (1994), pp. 174-175.
Wikipedia, Harshad number.
Brad Wilson, Construction of 2n consecutive n-Niven numbers, Fibonacci Quarterly, Vol. 35, No. 2 (1997), pp. 122-128.

Cf. A005349, A060159; A330927, A154701, A141769, A330929, A330930 (same for 2, 3, 4, 6, 7 consecutive harshad numbers).

f:=func; a:=[]; for k in [1..11000000] do  if forall{m:m in [0..4]|f(k+m)} then Append(~a,k); end if; end for; a; // Marius A. Burtea, Jan 03 2020

nivenQ[n_] := Divisible[n, Total @ IntegerDigits[n]]; niv = nivenQ /@ Range[5]; seq = {}; Do[niv = Join[Rest[niv], {nivenQ[k]}]; If[And @@ niv, AppendTo[seq, k - 4]], {k, 5, 10^7}]; seq
SequencePosition[Table[If[Divisible[n,Total[IntegerDigits[n]]],1,0],{n,10^7+200}],{1,1,1,1,1}][[;;,1]] (* Harvey P. Dale, Dec 24 2023 *)

{first( N=50, LEN=5, L=List())= for(n=1,oo, n+=LEN; for(m=1,LEN, n--%sumdigits(n) && next(2)); listput(L,n); N--|| break);L} \\ M. F. Hasler, Jan 03 2022

This A330928 = { A005349(k) | A005349(k+4) = A005349(k)+4 }. - M. F. Hasler, Jan 03 2022

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

Amiram Eldar, Mar 05 2022

			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.

Amiram Eldar, Table of n, a(n) for n = 1..10000

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.

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] &]

A330929 Starts of runs of 6 consecutive Niven (or Harshad) numbers (A005349).

Original entry on oeis.org

1, 2, 3, 4, 5, 10000095, 10000096, 12751220, 14250624, 22314620, 22604423, 25502420, 28501224, 35521222, 41441420, 41441421, 51004820, 56511023, 57002424, 70131620, 71042422, 71253024, 97740760, 102009620, 111573020, 114004824, 121136420, 124324220, 124324221

Offset: 1

Amiram Eldar, Jan 03 2020

Cooper and Kennedy proved that there are infinitely many runs of 20 consecutive Niven numbers. Therefore this sequence is infinite.

			10000095 is a term since 10000095 is divisible by 1 + 0 + 0 + 0 + 0 + 0 + 9 + 5 = 15, 10000096 is divisible by 16, ..., and 10000100 is divisible by 2.

Jean-Marie De Koninck, Those Fascinating Numbers, American Mathematical Society, 2009, p. 36, entry 110.

Amiram Eldar, Table of n, a(n) for n = 1..4000
Curtis Cooper and Robert E. Kennedy, On consecutive Niven numbers, Fibonacci Quarterly, Vol. 21, No. 2 (1993), pp. 146-151.
Helen G. Grundman, Sequences of consecutive Niven numbers, Fibonacci Quarterly, Vol. 32, No. 2 (1994), pp. 174-175.
Wikipedia, Harshad number.
Brad Wilson, Construction of 2n consecutive n-Niven numbers, Fibonacci Quarterly, Vol. 35, No. 2 (1997), pp. 122-128.

Cf. A005349, A060159, A141769, A154701, A330927, A330928, A330930.

f:=func; a:=[]; for k in [1..30000000] do  if forall{m:m in [0..5]|f(k+m)} then Append(~a,k); end if; end for; a; // Marius A. Burtea, Jan 03 2020

nivenQ[n_] := Divisible[n, Total @ IntegerDigits[n]]; niv = nivenQ /@ Range[6]; seq = {}; Do[niv = Join[Rest[niv], {nivenQ[k]}]; If[And @@ niv, AppendTo[seq, k - 5]], {k, 6, 10^7}]; seq

A352321 Numbers k such that k and k+1 are both Pell-Niven numbers (A352320).

Original entry on oeis.org

1, 4, 5, 9, 14, 28, 29, 33, 39, 63, 87, 110, 111, 115, 125, 140, 164, 168, 169, 183, 255, 275, 308, 338, 410, 444, 483, 507, 564, 579, 584, 704, 791, 984, 985, 999, 1004, 1024, 1025, 1115, 1134, 1154, 1164, 1211, 1265, 1308, 1323, 1351, 1395, 1415, 1424, 1491

Offset: 1

Amiram Eldar, Mar 12 2022

All the odd-indexed Pell numbers (A001653) are terms.

			4 is a term since 4 and 5 are both Pell-Niven numbers: the minimal Pell representation of 4, A317204(20) = 20, has the sum of digits 2+0 = 2 and 4 is divisible by 2, and the minimal Pell representation of 5, A317204(5) = 100, has the sum of digits 1+0+0 = 1 and 5 is divisible by 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000129, A265744, A317204.
Subsequence of A352320.
Subsequences: A001653, A352322.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720, A352090, A352108.

pell[1] = 1; pell[2] = 2; pell[n_] := pell[n] = 2*pell[n - 1] + pell[n - 2]; q[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]; Divisible[n, Plus @@ IntegerDigits[ Total[3^(s - 1)], 3]]]; Select[Range[1500], q[#] && q[#+1] &]

A330930 Starts of runs of 7 consecutive Niven (or Harshad) numbers (A005349).

Original entry on oeis.org

1, 2, 3, 4, 10000095, 41441420, 124324220, 124324221, 124324222, 207207020, 233735070, 331531220, 350602590, 409036350, 414414020, 467470110, 621621020, 621621021, 621621022, 1030302012, 1036035020, 1051807710, 1201800620, 1243242020, 1243242021, 1243242022

Offset: 1

Amiram Eldar, Jan 03 2020

Cooper and Kennedy proved that there are infinitely many runs of 20 consecutive Niven numbers. Therefore this sequence is infinite.

			10000095 is a term since 10000095 is divisible by 1 + 0 + 0 + 0 + 0 + 0 + 9 + 5 = 15, 10000096 is divisible by 16, ..., and 10000101 is divisible by 3.

Jean-Marie De Koninck, Those Fascinating Numbers, American Mathematical Society, 2009, p. 36, entry 110.

Amiram Eldar, Table of n, a(n) for n = 1..400
Curtis Cooper and Robert E. Kennedy, On consecutive Niven numbers, Fibonacci Quarterly, Vol. 21, No. 2 (1993), pp. 146-151.
Helen G. Grundman, Sequences of consecutive Niven numbers, Fibonacci Quarterly, Vol. 32, No. 2 (1994), pp. 174-175.
Wikipedia, Harshad number.
Brad Wilson, Construction of 2n consecutive n-Niven numbers, Fibonacci Quarterly, Vol. 35, No. 2 (1997), pp. 122-128.

Cf. A005349, A060159, A141769, A154701, A330927, A330928, A330929.

nivenQ[n_] := Divisible[n, Total @ IntegerDigits[n]]; niv = nivenQ /@ Range[7]; seq = {}; Do[niv = Join[Rest[niv], {nivenQ[k]}]; If[And @@ niv, AppendTo[seq, k - 6]], {k, 7, 10^7}]; seq

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

Amiram Eldar, Mar 12 2022

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

			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.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A352339, A352340.
Subsequence of A352342.
Subsequences: A352344, A352345.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720, A352090, A352108, A352321.

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] &]

A352509 Numbers k such that k and k+1 are both Catalan-Niven numbers (A352508).

Original entry on oeis.org

1, 4, 5, 9, 32, 44, 55, 56, 134, 144, 145, 146, 155, 184, 234, 324, 329, 414, 426, 429, 434, 455, 511, 512, 603, 636, 930, 1004, 1014, 1160, 1183, 1215, 1287, 1308, 1448, 1472, 1505, 1562, 1595, 1808, 1854, 1967, 1985, 1995, 2051, 2075, 2096, 2135, 2165, 2255

Offset: 1

Amiram Eldar, Mar 19 2022

			4 is a term since 4 and 5 are both Catalan-Niven numbers: the Catalan representation of 4, A014418(20) = 20, has the sum of digits 2+0 = 2 and 4 is divisible by 2, and the Catalan representation of 5, A014418(5) = 100, has the sum of digits 1+0+0 = 1 and 5 is divisible by 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000108, A014418, A014420.
Subsequence of A352508.
Subsequences: A038003, A352510, A352511.
Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720, A352090, A352108, A352321, A352343.

c[n_] := c[n] = CatalanNumber[n]; q[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]]]; Select[Range[2300], q[#] && q[#+1] &]

cp's OEIS Frontend

A351720 Numbers k such that k and k + 1 are both lazy-Lucas-Niven numbers (A351719).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A351715 Numbers k such that k and k + 1 are both Lucas-Niven numbers (A351714).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A352090 Numbers k such that k and k+1 are both tribonacci-Niven numbers (A352089).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A330928 Starts of runs of 5 consecutive Niven (or harshad) numbers (A005349).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A330929 Starts of runs of 6 consecutive Niven (or Harshad) numbers (A005349).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

A352321 Numbers k such that k and k+1 are both Pell-Niven numbers (A352320).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A330930 Starts of runs of 7 consecutive Niven (or Harshad) numbers (A005349).

Views

Author

Keywords

Comments

Examples