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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061021 a(n) = a(n-1)*a(n-2)-a(n-3). 2
3, 3, 3, 6, 15, 87, 1299, 112998, 146784315, 16586334025071, 2434613678231239448367, 40381315689150066251526220641224742, 98312903521778500654864668915856114278134197773017871243 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Any three consecutive terms are a solution to the Diophantine equation x^2 + y^2 + z^2 = xyz.

REFERENCES

E.T.H. Wang, Problem Proposal 701, College Mathematics Journal 32 (2001), p. 211.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,17

PROG

(PARI) { for (n=0, 17, if (n>2, a=a1*a2 - a3; a3=a2; a2=a1; a1=a, if (n==0, a=a3=3, if (n==1, a=a2=3, a=a1=3))); write("b061021.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 16 2009]

CROSSREFS

Sequence in context: A113920 A081848 A079988 * A126608 A088195 A131757

Adjacent sequences:  A061018 A061019 A061020 * A061022 A061023 A061024

KEYWORD

easy,nonn

AUTHOR

Stephen G. Penrice (spenrice(AT)ets.org), May 23 2001

EXTENSIONS

More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 03 2001

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 16 13:12 EST 2012. Contains 205909 sequences.