Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003116
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003116 Expansion of reciprocal of a determinant.
(Formerly M1068)
+0
5
1, 1, 2, 4, 7, 13, 23, 41, 72, 127, 222, 388, 677, 1179, 2052, 3569, 6203, 10778, 18722, 32513, 56455, 98017, 170161, 295389, 512755, 890043, 1544907, 2681554, 4654417, 8078679, 14022089, 24337897, 42242732, 73319574, 127258596, 220878683 (list; graph; listen)
OFFSET

0,3

COMMENT

G.f. is reciprocal of g.f. of A039924.

Conjecture: a(n) is the number of compositions (a_1,a_2,...) of n with each a_i-a_(i-1) <= 1; cf. A034297. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 09 2004

REFERENCES

D. H. Lehmer, Lecture course on history of mathematics, Univ. Calif. Berkeley, 1973.

LINKS

T. D. Noe, Table of n, a(n) for n=0..400

FORMULA

G.f.: 1/(Sum_{k>=0} x^(k^2)(-1)^k/(Product_{i=1..k} 1-x^i)).

EXAMPLE

1+x^2+2*x^4+4*x^6+7*x^8+13*x^10+23*x^12+...

PROGRAM

(PARI) a(n)=if(n<0, 0, polcoeff(1/sum(k=0, sqrtint(n), x^k^2/prod(i=1, k, x^i-1, 1+x*O(x^n))), n))

CROSSREFS

Cf. A003114, A039924.

Cf. A034297.

Sequence in context: A128609 A114832 A136299 this_sequence A078038 A048888 A026724

Adjacent sequences: A003113 A003114 A003115 this_sequence A003117 A003118 A003119

KEYWORD

nonn,nice,easy

AUTHOR

njas, Herman P. Robinson

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research