Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000904
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000904 a(n) = (n + 1) a(n - 1) + (n + 2) a(n - 2) + a(n - 3); a(1)=0, a(2)=3, a(3)=13.
(Formerly M2955 N1193)
+0
1
0, 3, 13, 83, 592, 4821, 43979, 444613, 4934720, 59661255, 780531033, 10987095719, 165586966816, 2660378564777, 45392022568023, 819716784789193, 15620010933562688, 313219935456042955, 6593238655510464741 (list; graph; listen)
OFFSET

1,2

COMMENT

Menage numbers.

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=1..100

E. Lucas, Th\'{e}orie des Nombres. Gauthier-Villars, Paris, 1891, Vol. 1, p. 495.

FORMULA

G.f.: 1/(x+x^2)^2*Sum_{n>=0} n!*(x/(1+x)^2)^n. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 29 2007

CROSSREFS

Sequence in context: A089461 A000684 A057993 this_sequence A135743 A123114 A104032

Adjacent sequences: A000901 A000902 A000903 this_sequence A000905 A000906 A000907

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Nov 27 2001

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research