Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136139
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136139 a(n+1)=sopfr(5a(n)+1), with sopfr=A001414. Finishes with a cycle with length 16. +0
3
1, 5, 15, 23, 33, 85, 76, 130, 41, 105, 265, 35, 19, 13, 16, 12, 61, 25, 15 (list; graph; listen)
OFFSET

1,2

COMMENT

In the class of recurrence sequences a(n+1)=sopfr(C*a(n)+D), with C=5, D=1. It finishes with a non trivial cycle.

FORMULA

a(n+1)=A001414(5*a(n)+1)

MATHEMATICA

see A136138

CROSSREFS

Cf. A136136, A136137, A136138.

Adjacent sequences: A136136 A136137 A136138 this_sequence A136140 A136141 A136142

Sequence in context: A110702 A141394 A127256 this_sequence A029480 A029504 A066548

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 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research