The OEIS is supported by the many generous donors to the OEIS Foundation.

 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

%I #7 Dec 10 2016 19:01:05

%S 1,5,15,23,33,85,76,130,41,105,265,35,19,13,16,12,61,25,15

%N a(n+1)=sopfr(5a(n)+1), with sopfr=A001414. Finishes with a cycle with length 16.

%C 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.

%C The cycle has 16 terms. - _Harvey P. Dale_, May 06 2012

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

%t see A136138

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

%Y Cf. A136136, A136137, A136138.

%K fini,nonn

%O 1,2

%A _Carlos Alves_, Dec 16 2007

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.

Last modified September 10 16:14 EDT 2024. Contains 375790 sequences. (Running on oeis4.)