Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129973
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129973 a(n) = A000045(n)-A000931(n). +0
1
0, 0, 0, 1, 1, 3, 5, 9, 16, 27, 46, 77, 128, 212, 349, 573, 938, 1532, 2498, 4067, 6614, 10746, 17446, 28306, 45903, 74409, 120577, 195337, 316379, 512332, 829527, 1342940, 2173899, 3518736, 5695148, 9217213, 14916771, 24139826, 39064336 (list; graph; listen)
OFFSET

1,6

COMMENT

Difference between the Fibonacci sequence A000045 and the Padovan sequence A000931. Always >= 0.

Limit Table[N[(Fibonacci[n + 1] - a[n + 1])/(Fibonacci[n] - a[n])], {n, 4, 40}]; limit[a(n+1)/a(n),n->Infinity]->(1+Sqrt[5])/2

FORMULA

G.f.: x^4/((1-x-x^2)(1-x^2-x^3)). a(n)=a(n-1)+2*a(n-2)-2*a(n-4)-a(n-5). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2008]

MATHEMATICA

(* Minimal Pisot sequence sequence : A000931 : Padovan sequence*) a[0] = 0; a[1] = 1; a[2] = 1; a[n_] := a[n] = a[n - 2] + a[n - 3]; aa = Table[Fibonacci[n] - a[n], {n, 0, 40}]

CROSSREFS

Cf. A000045, A000931.

Sequence in context: A117480 A018260 A023656 this_sequence A018159 A094980 A069818

Adjacent sequences: A129970 A129971 A129972 this_sequence A129974 A129975 A129976

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 13 2007

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 November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research