Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083410
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083410 A083385(n)/n. +0
8
1, 4, 22, 154, 1306, 12994, 148282, 1908274, 27333706, 431220034, 7428550042, 138737478994, 2792050329706, 60231133487074, 1386484468239802, 33921605427779314, 878976357571495306, 24046780495646314114, 692622345890928153562, 20950628198687114521234, 663992311200423614606506 (list; graph; listen)
OFFSET

1,2

COMMENT

Stirling transform of A052849(n+1)=[4,12,48,240,...] is 4*a(n)=[4,16,88,616,...]. - Michael Somos Mar 04 2004

Stirling transform of A001710(n+1)=[1,3,12,160,...] is a(n)=[1,4,22,154,...]. - Michael Somos Mar 04 2004

Stirling transform of A001563(n+1)=[4,18,96,600,...] is a(n+1)=[4,22,154,...]. - Michael Somos Mar 04 2004

LINKS

N. J. A. Sloane and Thomas Wieder, The Number of Hierarchical Orderings, Order 21 (2004), 83-89.

FORMULA

E.g.f.: (1/(2-exp(x))^2-1)/2. - Michael Somos Mar 04 2004

PROGRAM

(PARI) a(n)=if(n<0, 0, n!*polcoeff(subst((1/(1-y)^2-1)/2, y, exp(x+x*O(x^n))-1), n))

CROSSREFS

A005649(n)=2*a(n), if n>0.

Pairwise sums of A091346.

Sequence in context: A062817 A000307 A049376 this_sequence A052772 A052650 A112697

Adjacent sequences: A083407 A083408 A083409 this_sequence A083411 A083412 A083413

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 08 2003

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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research