Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122752
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122752 a(0) = 1; a(1) = 1; a(2) = 1; a(n) = (n-1)a(n-1)+(n-2)a(n-2)+(n-3)a(n-3) for n >= 3. +0
1
1, 1, 1, 3, 12, 59, 352, 2455, 19592, 176033, 1758218, 19323213, 231721820, 3010799363, 42133608902, 631791578187, 10105884589152, 171760897623865, 3091106286704942, 58721542573721093, 1174269157320995428 (list; graph; listen)
OFFSET

1,4

MAPLE

a[0]:=1: a[1]:=1: a[2]:=1: for n from 3 to 20 do a[n]:=(n-1)*a[n-1]+(n-2)*a[n-2]+(n-3)*a[n-3] od: seq(a[n], n=0..20);

MATHEMATICA

a[0] = 1; a[1] = 1; a[2] = 1; a[n_] := a[n] = (n - 1)*a[n - 1] + (n - 2)*a[n - 2] + (n - 3)*a[n - 3] Table[a[n], {n, 0, 50}]

CROSSREFS

Sequence in context: A064856 A080337 A101054 this_sequence A020102 A065080 A114419

Adjacent sequences: A122749 A122750 A122751 this_sequence A122753 A122754 A122755

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 21 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 08 2006

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