Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154913
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154913 A triangular sequence: p = 2; q = 1; t(n,m) = (p^(n - m)*q^m + p^m*q^( n - m))*(StirlingS1[n, m] + StirlingS1[n, n - m]). +0
1
4, 3, 3, 5, -8, 5, 9, -6, -6, 9, 17, -120, 176, -120, 17, 33, 252, -180, -180, 252, 33, 65, -4590, 7180, -7200, 7180, -4590, 65, 129, 46134, -57204, 21336, 21336, -57204, 46134, 129, 257, -658840, 910520, -603680, 433216, -603680, 910520, -658840, 257 (list; table; graph; listen)
page 1

Search completed in 0.001 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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research