Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111535
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111535 a(n) = A111534(n)/n = A111528(n,n)/n for n>=1. +0
2
1, 2, 11, 104, 1409, 24912, 543479, 14098112, 423643509, 14464318560, 552830505347, 23375870438400, 1083128382648857, 54563592529048064, 2968656741661668975, 173460812744585863168, 10832194187368473624893 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = [x^n] (1/n)*Log( Sum_{m=0..n} (n-1+m)!/(n-1)!*x^m ) for n>=1.

PROGRAM

(PARI) a(n)=if(n<1, 0, (1/n)*polcoeff(log(sum(m=0, n, (n-1+m)!/(n-1)!*x^m)), n))

CROSSREFS

Cf: A111528 (table), A003319 (row 1), A111529 (row 2), A111530 (row 3), A111531 (row 4), A111532 (row 5), A111533 (row 6).

Adjacent sequences: A111532 A111533 A111534 this_sequence A111536 A111537 A111538

Sequence in context: A024721 A081716 A099713 this_sequence A088690 A118805 A053988

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 06 2005

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 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research