The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A349486 a(1) = 2. a(n) is the smallest number in A349484, which is not an earlier term and for which a(n-1) + a(n) is in A349484. 0
2, 3, 4, 5, 225, 18, 9, 27, 21, 6, 48, 108, 72, 36, 156, 54, 81, 111, 400, 7, 20, 210, 306, 135, 153, 288, 112, 224, 100, 8, 10, 902, 1168, 192, 324, 180, 50, 230, 900, 201, 280, 420, 209, 511, 407, 481, 702, 216, 405, 243, 378, 486, 432, 480, 621, 351, 513, 648 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(1) = 2 and a(2) = 3 are Niven numbers with derivatives 2' = 1 and 3' = 1 which are Niven numbers, and a(1) + a(2) = 2 + 3 = 5 which is Niven number and 5' = 1 is also a Niven number.
PROG
(Magma) f:=func<n |n le 1 select 0 else n*(&+[Factorisation(n)[i][2] / Factorisation(n)[i][1]: i in [1..#Factorisation(n)]])>; a:=[]; niven:=func<n|n mod &+Intseq(n) eq 0 >; ff:=func<n|niven(n) and niven(Floor(f(n)))>; a:=[2]; for n in [2..58] do k:=3; while k in a or not(ff(k) and ff(k+a[n-1])) do k:=k+1; end while; Append(~a, k); end for; a;
CROSSREFS
Cf. A003415 (arithmetic derivative), A005349 (Niven numbers), A349484.
Sequence in context: A274028 A037436 A115900 * A010347 A004878 A032546
KEYWORD
nonn,base
AUTHOR
Marius A. Burtea, Nov 20 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 01:31 EDT 2024. Contains 372536 sequences. (Running on oeis4.)