Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136140
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136140 Length of the cycles in which finish the sequences a(k+1)=sopfr(n a(k)+1), with sopfr=A001414. +0
4
1, 1, 1, 6, 16, 5, 2, 23, 2, 4, 56, 17, 56, 2, 29, 22, 8, 8, 2, 29, 15, 4, 5, 72, 4, 11, 55, 56, 42, 83, 17, 43, 71, 14, 2, 4, 2, 5, 5, 49, 17, 40, 71, 48, 17, 68, 13, 16, 76, 115, 83, 22, 6, 125, 7, 19, 10, 9, 70, 1, 31, 36, 72, 3, 13, 28, 9, 18, 57, 63, 31, 34, 16, 225, 26, 53, 116 (list; graph; listen)
OFFSET

1,4

MATHEMATICA

Lcycle = Function[ x, z = 1; pz = Position[x[[Range[z]]], x[[z + 1]]]; While[Length[pz] == 0, z++; pz = Position[ x[[Range[z]]], x[[z + 1]]]]; z - pz[[1, 1]] + 1]; sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; Table[tb = NestList[sopfr[n# + 1] &, 1, 350]; Lcycle[tb], {n, 1, 100}]

CROSSREFS

Cf. A136136, A136137, A136138, A136139.

Adjacent sequences: A136137 A136138 A136139 this_sequence A136141 A136142 A136143

Sequence in context: A024081 A068941 A107777 this_sequence A085452 A028286 A046629

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 October 12 14:39 EDT 2008. Contains 144830 sequences.


AT&T Labs Research