Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100701
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100701 (T(n-1) + T(n-2)) + T(n-1)*T(n-2) where T(0)=2,T(1)=3 and n>= 2. +0
1
2, 3, 11, 47, 575, 27647, 15925247, 440301256703, 7011906707722862591, 3087351335301583621409910816767, 21648219537098310851336266290644502090473753542655 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = (a(n-1) + a(n-2)) + a(n-1)*a(n-2) with a(0)=2 and a(1)=3

EXAMPLE

a(2) = (2 + 3) + 2*3 = 11

MATHEMATICA

a=2; b=3; lst={a, b}; Do[c=a*b+a+b; AppendTo[lst, c]; a=b; b=c, {n, 2*3!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 05 2009]

CROSSREFS

Cf. A063896.

Sequence in context: A162101 A128455 A041345 this_sequence A011365 A072876 A020133

Adjacent sequences: A100698 A100699 A100700 this_sequence A100702 A100703 A100704

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Dec 09 2004

EXTENSIONS

More terms and Mathematica program Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 05 2009

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research