Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079429
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079429 a(0) = 2, a(1) = 3, a(2) = 5; a(n) = a(n-1) + [a(n-1)-a(n-2)] * [a(n-2)-a(n-3)]. +0
1
2, 3, 5, 7, 11, 19, 51, 307, 8499, 2105651, 17181974835, 36028814200938803, 618970019678718951650500915, 22300745198530623760505737951367313156481331, 13803492693581127574869511746854796103432841704846511061692361604079923 (list; graph; listen)
OFFSET

0,1

FORMULA

Conjecture: a(n)=A011455(n-2)+5 where defined. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 26 2007

EXAMPLE

a(3) = 7, since a(3) = a(2) + [(a(2)-a(1)) * (a(1)-a(0))] = 5 + ((5-3)*(3-2))

MATHEMATICA

a[0] = 2; a[1] = 3; a[2] = 5; a[n_] := a[n] = a[n - 1] + (a[n - 1] - a[n - 2])*(a[n - 2] - a[n - 3]); Table[a[n], {n, 0, 14}]

CROSSREFS

Adjacent sequences: A079426 A079427 A079428 this_sequence A079430 A079431 A079432

Sequence in context: A087769 A084736 A089472 this_sequence A072299 A038204 A075049

KEYWORD

nonn

AUTHOR

Ajay Chhabra (ajay(AT)cantab.net), Jan 08 2003

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 08 2002

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 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research