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!)
A343416 a(n) = A001414(n) + A000203(n) + A001414(A000203(n)) + A000203(A001414(n)). 2

%I #7 Apr 18 2021 22:33:34

%S 1,11,15,25,22,30,29,41,44,41,42,54,50,55,56,85,61,78,68,76,70,73,80,

%T 94,90,93,73,92,99,112,105,104,97,104,99,139,134,125,116,126,137,149,

%U 146,137,119,140,154,182,117,167,146,149,172,157,131,161,151,166,191,224,218,190,150,294,155,205

%N a(n) = A001414(n) + A000203(n) + A001414(A000203(n)) + A000203(A001414(n)).

%C If n = prime(k) is prime, a(n) = 3*prime(k)+1+A210934(k).

%H Robert Israel, <a href="/A343416/b343416.txt">Table of n, a(n) for n = 1..10000</a>

%e For n = 3, A001414(3) = 3, A000203(3) = A000203(A001414(3) = 4 and A001414(A000203(3)) = 4, so a(3) = 3+4+4+4 = 15.

%p spf:= proc(n) local t; add(t[1]*t[2],t=ifactors(n)[2]) end proc:

%p f:= proc(n) local a,b;

%p a:= spf(n);

%p b:= numtheory:-sigma(n);

%p a+b+spf(b)+numtheory:-sigma(a)

%p end proc:

%p map(f, [$1..100]);

%Y Cf. A000203, A001414, A210934.

%K nonn

%O 1,2

%A _J. M. Bergot_ and _Robert Israel_, Apr 14 2021

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 August 13 14:36 EDT 2024. Contains 375142 sequences. (Running on oeis4.)