Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092255
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092255 a(0) = 1; for n > 0, b(n) - n*b(n-1), b() = A076177(). +0
8
1, 1, 3, 10, 23, 66, 222, 561, 1647, 5410, 14318, 42351, 137018, 372191, 1105275, 3537540, 9772767, 29090826, 92364198, 258208671, 769820418, 2429091885, 6850744365, 20447143866, 64200928194, 182303186391, 544550917797 (list; graph; listen)
OFFSET

0,3

COMMENT

For n>=1, a(n) mod 2 = A010060(n) the Thue-Morse sequence - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 2004

FORMULA

a(n)=n!*sum(i+j+k=n, 1/(i!*j!*k!)) (0<=k<=j<=i<=n). - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 2004

PROGRAM

(PARI) a(n)=sum(i=0, n, sum(j=0, i, sum(k=0, j, if(i+j+k-n, 0, n!/i!/j!/k!))))

CROSSREFS

Sequence in context: A115982 A167243 A134438 this_sequence A105861 A041327 A029880

Adjacent sequences: A092252 A092253 A092254 this_sequence A092256 A092257 A092258

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 20 2004

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 2004

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research