login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A136136
a(n+1)=sopfr(2a(n)+1), with sopfr=A001414. Finishes with 10 (fixed point).
5
1, 3, 7, 8, 17, 12, 10
OFFSET
1,2
COMMENTS
The class of recurrence sequences a(n+1)=sopfr(C*a(n)+D) may finish with a fixed point or with a cycle.
FORMULA
a(n+1)=A001414(2*a(n)+1)
MATHEMATICA
sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; NestList[sopfr[2# + 1] &, 1, 10]
CROSSREFS
Cf. A001414.
Sequence in context: A263519 A105263 A242572 * A057548 A122227 A259571
KEYWORD
fini,full,nonn
AUTHOR
Carlos Alves, Dec 16 2007
STATUS
approved