|
|
|
|
|
|
|
|
|
#22 by Joerg Arndt at Sun Mar 17 07:36:57 EDT 2024
|
|
|
|
|
|
|
|
#21 by Michel Marcus at Sun Mar 17 06:26:17 EDT 2024
|
|
|
|
|
|
|
|
#20 by Michel Marcus at Sun Mar 17 06:26:13 EDT 2024
|
|
|
|
|
|
|
|
#19 by Michel Marcus at Sun Mar 17 06:26:09 EDT 2024
|
|
| LINKS
|
Brad Wilson <, <a href="http://www.fq.math.ca/Scanned/35-2/wilson.pdf">Construction of 2n consecutive n-Niven numbers</a>, Fibonacci Quarterly, Vol. 35, No. 2 (1997), pp. 122-128.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#18 by Michael S. Branicky at Sun Mar 17 06:17:34 EDT 2024
|
|
|
|
|
|
|
|
#17 by Michael S. Branicky at Sun Mar 17 06:17:31 EDT 2024
|
|
| PROG
|
(Python)
from itertools import count, islice
def agen(): # generator of terms
h1, h2 = 1, 2
while True:
if h2 - h1 == 1: yield h1
h1, h2 = h2, next(k for k in count(h2+1) if k%sum(map(int, str(k))) == 0)
print(list(islice(agen(), 52))) # Michael S. Branicky, Mar 17 2024
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#16 by Harvey P. Dale at Sun Dec 24 15:17:21 EST 2023
|
|
|
|
|
|
|
|
#15 by Harvey P. Dale at Sun Dec 24 15:17:18 EST 2023
|
|
| MATHEMATICA
|
SequencePosition[Table[If[Divisible[n, Total[IntegerDigits[n]]], 1, 0], {n, 2000}], {1, 1}][[;; , 1]] (* Harvey P. Dale, Dec 24 2023 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#14 by Charles R Greathouse IV at Thu Sep 08 08:46:24 EDT 2022
|
|
| PROG
|
(MAGMAMagma) f:=func<n|n mod &+Intseq(n) eq 0>; a:=[]; for k in [1..2000] do if forall{m:m in [0..1]|f(k+m)} then Append(~a, k); end if; end for; a; // Marius A. Burtea, Jan 03 2020
|
|
|
|
|
Discussion
|
| Thu Sep 08
| 08:46
| OEIS Server: https://oeis.org/edit/global/2944
|
|
|
|
|
|
|
#13 by Alois P. Heinz at Sat Jan 04 11:24:39 EST 2020
|
|
|
|
|
|
|
