Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072374
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072374 a(1) = 1; a(n) = 1 + Sum_{i=1..n} Product_{j=i..2*i-1} (n-j). +0
7
1, 2, 3, 6, 11, 24, 51, 122, 291, 756, 1979, 5526, 15627, 46496, 140451, 442194, 1414931, 4687212, 15785451, 54764846, 193129659, 698978136, 2570480147, 9672977706, 36967490691, 144232455524, 571177352091, 2304843053382, 9434493132011, 39289892366736 (list; graph; listen)
OFFSET

1,2

COMMENT

A122852 is another version of the same sequence. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 18 2008

FORMULA

The sequence 1, 1, 2, 3, .. has a(n)=sum{k=0..floor(n/2), C(n-k, k)k!} (diagonal sums of permutation triangle A008279). - Paul Barry (pbarry(AT)wit.ie), May 12 2004

CROSSREFS

Adjacent sequences: A072371 A072372 A072373 this_sequence A072375 A072376 A072377

Sequence in context: A047750 A072187 A122852 this_sequence A107113 A032256 A051603

KEYWORD

nonn

AUTHOR

njas, Jul 19 2002

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research