OFFSET
0,2
COMMENTS
In the class of recurrence sequences a(n+1)=sopfr(C*a(n)+D), with C=4, D=1. It is a simple example where it finishes with a nontrivial cycle.
FORMULA
a(n+1) = A001414(4*a(n)+1).
MATHEMATICA
sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; NestList[sopfr[4# + 1] &, 1, 40]
NestList[Total[Times@@@FactorInteger[4*#+1]]&, 1, 30] (* Harvey P. Dale, Sep 23 2019 *)
CROSSREFS
KEYWORD
fini,nonn
AUTHOR
Carlos Alves, Dec 16 2007
STATUS
approved