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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139759 A Fibonacci based recurrence. 1
1, 1, 2, 3, 4, 7, 10, 11, 20, 31, 42, 73, 110, 183, 292, 473, 762, 1235, 1992, 3209, 5198, 8407, 13604, 22011, 35614, 57625, 93238, 150863, 244100, 394963, 639054, 1034017, 1673070, 2707089, 4380158, 7087241, 11467398, 18554639, 30022036, 48576675 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

E. S. Rowland, A natural prime-generating recurrence, arXiv:0710.3217 [math.NT]

FORMULA

a(n)=a(n-1)+a(n-2)+gcd(n,a(n-1))-gcd(n,a(n-2))

MAPLE

A139759 := proc(n) option remember ; if n <= 1 then 1; else an_1 := A139759(n-1) ; an_2 := A139759(n-2) ; an_1+an_2+gcd(n, an_1)-gcd(n, an_2) ; fi ; end: seq(A139759(n), n=0..60) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 20 2008

CROSSREFS

Cf. A000045.

Sequence in context: A080724 A089589 A047546 * A030292 A204231 A135419

Adjacent sequences:  A139756 A139757 A139758 * A139760 A139761 A139762

KEYWORD

easy,nonn

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), May 20 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 20 2008

Converted reference to link - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2009

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 10:43 EST 2012. Contains 205904 sequences.