A136136 - OEIS

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

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”).

Other ways to Give

A136136

a(n+1)=sopfr(2a(n)+1), with sopfr=A001414. Finishes with 10 (fixed point).

%I #4 Sep 24 2013 00:41:43

%S 1,3,7,8,17,12,10

%N a(n+1)=sopfr(2a(n)+1), with sopfr=A001414. Finishes with 10 (fixed point).

%C The class of recurrence sequences a(n+1)=sopfr(C*a(n)+D) may finish with a fixed point or with a cycle.

%F a(n+1)=A001414(2*a(n)+1)

%t sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; NestList[sopfr[2# + 1] &, 1, 10]

%Y Cf. A001414.

%K fini,full,nonn

%O 1,2

%A _Carlos Alves_, Dec 16 2007