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!)
A136136 a(n+1)=sopfr(2a(n)+1), with sopfr=A001414. Finishes with 10 (fixed point). 5
1, 3, 7, 8, 17, 12, 10 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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

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 July 22 13:05 EDT 2024. Contains 374499 sequences. (Running on oeis4.)