|
|
A330928
|
|
Starts of runs of 5 consecutive Niven (or harshad) numbers (A005349).
|
|
11
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Cooper and Kennedy proved that there are infinitely many runs of 20 consecutive Niven numbers. Therefore this sequence is infinite.
|
|
REFERENCES
|
Jean-Marie De Koninck, Those Fascinating Numbers, American Mathematical Society, 2009, p. 36, entry 110.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
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.
|
|
MATHEMATICA
|
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 *)
|
|
PROG
|
(Magma) f:=func<n|n mod &+Intseq(n) eq 0>; 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
(PARI) {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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|