Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003659
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003659 Shifts left under Stirling-2 transform.
(Formerly M1681)
+0
5
1, 1, 2, 6, 26, 152, 1144, 10742, 122772, 1673856, 26780972, 496090330, 10519217930, 252851833482, 6832018188414, 205985750827854, 6885220780488694, 253685194149119818, 10250343686634687424 (list; graph; listen)
OFFSET

1,3

COMMENT

Apart from leading term, number of M-sequences from multicomplexes on at most 4 variables with no monomial of degree more than n+1.

Stirling-2 transform of a(n) = [1, 1, 2, 6, 26, ...] is a(n+1) = [1, 2, 6, 26, ...].

Eigensequence of Stirling-2 triangle A008277. - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 23 2007

REFERENCES

S. Linusson, The number of M-sequences and f-vectors, Combinatorica, 19 (1999), 255-266.

LINKS

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Algebra and Its Applications, vol. 226-228, pp. 57-72, 1995 (Abstract, pdf, ps)

N. J. A. Sloane, Transforms

FORMULA

E.g.f. A(x) satisfies A(x)'=1+A(exp(x)-1).

PROGRAM

(PARI) {a(n)=local(A, E); if(n<0, 0, A=O(x); E=exp(x+x*O(x^n))-1; for(m=1, n, A=intformal( subst( 1+A, x, E+x*O(x^m)))); n!*polcoeff(A, n))} /* Michael Somos Mar 08 2004 */

CROSSREFS

Cf. A048801.

Adjacent sequences: A003656 A003657 A003658 this_sequence A003660 A003661 A003662

Sequence in context: A103937 A000629 A032187 this_sequence A032271 A107104 A123306

KEYWORD

nonn,nice,eigen

AUTHOR

njas, Mira Bernstein

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 May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research