Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136136
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136136 a(n+1)=sopfr(2a(n)+1), with sopfr=A001414. Finishes with 10 (fixed point). +0
6
1, 3, 7, 8, 17, 12, 10 (list; graph; listen)
OFFSET

1,2

COMMENT

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

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.

Adjacent sequences: A136133 A136134 A136135 this_sequence A136137 A136138 A136139

Sequence in context: A076683 A045542 A031404 this_sequence A057548 A122227 A125570

KEYWORD

fini,nonn

AUTHOR

Carlos Alves (cjsalves(AT)gmail.com), Dec 16 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research