login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136139 a(n+1)=sopfr(5a(n)+1), with sopfr=A001414. Finishes with a cycle with length 16. 2
1, 5, 15, 23, 33, 85, 76, 130, 41, 105, 265, 35, 19, 13, 16, 12, 61, 25, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In the class of recurrence sequences a(n+1)=sopfr(C*a(n)+D), with C=5, D=1. It finishes with a nontrivial cycle.

The cycle has 16 terms. - Harvey P. Dale, May 06 2012

LINKS

Table of n, a(n) for n=1..19.

FORMULA

a(n+1) = A001414(5*a(n)+1).

MATHEMATICA

see A136138

NestList[Total[Flatten[PadRight[{}, Last[#], First[#]]&/@FactorInteger[ 5*#+1]]]&, 1, 20] (* Harvey P. Dale, Mar 06 2012 *)

CROSSREFS

Cf. A136136, A136137, A136138.

Sequence in context: A110702 A141394 A127256 * A029480 A029504 A066548

Adjacent sequences:  A136136 A136137 A136138 * A136140 A136141 A136142

KEYWORD

fini,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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 18:27 EDT 2020. Contains 337432 sequences. (Running on oeis4.)