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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073313 Binomial transform of generalized Lucas numbers S(n)=S(n-1)+S(n-2)+S(n-3), S(0)=3,S(1)=1,S(2)=3. 1
3, 4, 8, 22, 64, 184, 524, 1488, 4224, 11992, 34048, 96672, 274480, 779328, 2212736, 6282592, 17838080, 50647424, 143802560, 408296704, 1159271424, 3291504000, 9345523712, 26534621696, 75339399936, 213910160384, 607352285184 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Limit as n-> infinity of a(n)/a(n-1) is 1+c, where c=1.83928675...

REFERENCES

H. Prodinger, "Some information about the Binomial transform", The Fibonacci Quarterly, 32, 1994, 412-415.

N. J. A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995.

LINKS

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210.

H. Prodinger, Some information about the binomial transform., The Fibonacci Quarterly, 32, 1994, 412-415.

FORMULA

a(n) is the trace of the n-th power of 3*3 matrix: first row (2, 1, 0), second row (1, 1, 1), third row (1, 0, 1). It satisfies recurrence a(n)=4*a(n-1)-4*a(n-2)+ 2*a(n-3), a(0)=3, a(1)=4, a(2)=8. Generating function: (3-8x+4x^2)/(1-4x+4x^2-2x^3).

MATHEMATICA

f[x_] := f[x]=4*f[x-1]-4*f[x-2]+2*f[x-3]; f[0]=3; f[1]=4; f[2]=8

CROSSREFS

Cf. A001644.

Sequence in context: A051440 A101932 A204521 * A168382 A155701 A119529

Adjacent sequences:  A073310 A073311 A073312 * A073314 A073315 A073316

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jul 26 2002

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 30 2002

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 16:51 EST 2012. Contains 205938 sequences.