login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034970 a(n) is the greatest prime factor of a(n-2)*a(n-1)-1. 2
2, 3, 5, 7, 17, 59, 167, 821, 2539, 1042259, 508903, 5765312303, 1461701, 1404527126434567, 2034580216153, 97552206663238517, 3105563257, 46137561830961960349, 9777395920402541, 6719860896292085951563127, 5367788603966004659, 33011914147 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

PROG

(PARI) A034970(a, b) = {local(f); f=factor(a*b-1); f[matsize(f)[1], 1]}

a=2; b=3; print(a); print(b)

for(n=2, 28, c=A034970(a, b); print(c); a=b; b=c)

CROSSREFS

Sequence in context: A100532 A040149 A168034 * A048417 A071710 A048403

Adjacent sequences:  A034967 A034968 A034969 * A034971 A034972 A034973

KEYWORD

nonn,easy,nice

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu).

EXTENSIONS

Cf. A031441.

More terms from James A. Sellers (sellersj(AT)math.psu.edu)

Terms corrected by Michael B. Porter (michael_b_porter(AT)yahoo.com), Mar 14 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:17 EST 2012. Contains 206009 sequences.