Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136148
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136148 Length of the cycles in which finish the sequences a(k+1)=sopfr(n a(k)), with sopfr=A001414. +0
2
1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 3, 1, 3, 4, 6, 4, 1, 4, 6, 1, 4, 1, 4, 6, 5, 6, 8, 3, 2, 6, 6, 2, 8, 1, 7, 2, 8, 1, 1, 7, 9, 1, 8, 2, 1, 3, 2, 1, 8, 4, 4, 5, 1, 2, 3, 2, 4, 2, 5, 8, 1, 2, 3, 8, 8, 2, 2, 1, 4, 1, 5, 5, 5, 4, 2, 8, 5, 8, 4, 4, 5, 3, 8, 4, 1, 2, 6, 8, 9, 4, 1, 8, 3, 8, 4, 4, 4, 3, 1 (list; graph; listen)
OFFSET

0,4

COMMENT

Similar to A136140 or to A136147, now with D=0.

MAPLE

see A136140

CROSSREFS

Cf. A136140, A136147.

Sequence in context: A010277 A065372 A015137 this_sequence A132409 A030337 A136406

Adjacent sequences: A136145 A136146 A136147 this_sequence A136149 A136150 A136151

KEYWORD

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research