Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001645
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001645 A Fielder sequence.
(Formerly M2626 N1041)
+0
1
1, 3, 7, 11, 26, 45, 85, 163, 304, 578, 1090, 2057, 3888, 7339, 13862, 26179, 49437, 93366, 176321, 332986, 628852, 1187596, 2242800, 4235569, 7998951, 15106172, 28528288, 53876211, 101746240, 192149690, 362878313, 685302531, 1294206745 (list; graph; listen)
OFFSET

1,2

REFERENCES

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Fielder, Daniel C.; Special integer sequences controlled by three parameters. Fibonacci Quart 6 1968 64-70.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

FORMULA

G.f.: x(1+2x+3x^2+5x^4)/(1-x-x^2-x^3-x^5).

MAPLE

A001645:=-(1+2*z+3*z**2+5*z**4)/(-1+z+z**2+z**3+z**5); [Conjectured by S. Plouffe in his 1992 dissertation.]

PROGRAM

(PARI) a(n)=if(n<0, 0, polcoeff(x*(1+2*x+3*x^2+5*x^4)/(1-x-x^2-x^3-x^5)+x*O(x^n), n))

CROSSREFS

Sequence in context: A099902 A092284 A024459 this_sequence A103798 A093361 A051202

Adjacent sequences: A001642 A001643 A001644 this_sequence A001646 A001647 A001648

KEYWORD

nonn

AUTHOR

njas

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research