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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178094 a(1)=a(2)=1; thereafter a(n) = lpf(a(n-1)+a(n-2)), where lpf = "least prime factor". 2
1, 1, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Cycles with a period of length 9.
LINKS
MATHEMATICA
nxt[{a_, b_}]:={b, FactorInteger[a+b][[1, 1]]}; NestList[nxt, {1, 1}, 110][[;; , 1]] (* or *) PadRight[ {1, 1}, 110, {5, 7, 2, 3, 5, 2, 7, 3, 2}] (* Harvey P. Dale, May 29 2023 *)
CROSSREFS
Sequence in context: A272636 A066949 A073481 * A364874 A122556 A175723
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 16 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)