This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319699 a(n) = A001065(A252463(n)). 8
 0, 0, 1, 1, 1, 1, 1, 3, 3, 1, 1, 6, 1, 1, 6, 7, 1, 4, 1, 8, 8, 1, 1, 16, 4, 1, 7, 10, 1, 9, 1, 15, 10, 1, 9, 21, 1, 1, 14, 22, 1, 11, 1, 14, 16, 1, 1, 36, 6, 6, 16, 16, 1, 13, 11, 28, 20, 1, 1, 42, 1, 1, 22, 31, 15, 15, 1, 20, 22, 13, 1, 55, 1, 1, 21, 22, 13, 17, 1, 50, 15, 1, 1, 54, 17, 1, 26, 40, 1, 33, 17, 26, 32, 1, 21, 76, 1, 8, 28, 43, 1, 21, 1, 46, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Also for n > 1, sum of A318889(x) for all x encountered when map x -> A252463(x) is iterated, starting from x = A252463(n), until 1 is reached. LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = A001065(A252463(n)). a(n) = A001065(n) - A318889(n). PROG (PARI) A001065(n) = (sigma(n)-n); A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)}; A252463(n) = if(!(n%2), n/2, A064989(n)); A319699(n) = A001065(A252463(n)); CROSSREFS Cf. A001065, A005940, A252463, A318889. Cf. also A319694, A319700, A319703, A319989, A320107, A320111. Sequence in context: A196989 A034871 A015109 * A157636 A086626 A244500 Adjacent sequences:  A319696 A319697 A319698 * A319700 A319701 A319702 KEYWORD nonn AUTHOR Antti Karttunen, Nov 22 2018 STATUS approved

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

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)