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!)
A348215 a(n) is the sum of the iterated A348158 starting from n until a fixed point is reached. 2
0, 1, 0, 3, 0, 3, 0, 7, 0, 5, 0, 7, 0, 7, 0, 15, 0, 9, 0, 15, 0, 11, 0, 15, 0, 13, 0, 21, 0, 15, 0, 31, 0, 17, 0, 25, 0, 19, 0, 31, 0, 21, 0, 33, 0, 23, 0, 31, 0, 25, 0, 39, 0, 27, 0, 49, 0, 29, 0, 31, 0, 31, 57, 120, 0, 33, 0, 51, 0, 35, 0, 57, 0, 37, 0, 57 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The first odd number k with a(k) > 0 is k = 63.
LINKS
FORMULA
a(n) = 0 if and only if n is in A326835.
a(2*n) > 0 for all n.
EXAMPLE
a(4) = 3 since the iterations of the map x -> A348158(x) starting from 4 are 4 -> 3.
a(64) = 120 since the iterations of the map x -> A348158(x) starting from 64 are 64 -> 63 -> 57, and 63 + 57 = 120.
MATHEMATICA
f[n_] := Plus @@ DeleteDuplicates @ Map[EulerPhi, Divisors[n]]; a[n_] := Plus @@ Most @ FixedPointList[f, n] - n; Array[a, 100]
CROSSREFS
Sequence in context: A045763 A132748 A022901 * A331739 A356169 A055945
KEYWORD
nonn
AUTHOR
Amiram Eldar, Oct 07 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 10 01:03 EDT 2024. Contains 372354 sequences. (Running on oeis4.)