login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129785 a(n+1) = Product from k=0 to k=n of 1 + C(n,k)*a(k), with a(0) = 1 and C(n,k) the ordinary binomial coefficient. 1
1, 2, 6, 70, 18886, 3534626502, 313999279896461576406, 6253297416830848418609522661421870085933646 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

A product analog of the Bell numbers.

REFERENCES

H. W. Gould, A product analog of the Bell numbers, unpublished manuscript, Jun 03 2007.

LINKS

Table of n, a(n) for n=0..7.

EXAMPLE

a(5) = (1+1)(1+8)(1+36)(1+280)(1+18886)

MAPLE

A129785 := proc(n)

    a := 1 ;

    for k from 0 to n-1 do

        a := a*(1+binomial(n-1, k)*procname(k)) ;

    end do:

    a ;

end proc: # R. J. Mathar, Nov 24 2013

MATHEMATICA

Clear[a]; a[n_]:= a[n] = Product[1 + Binomial[n-1, k]*a[k], {k, 0, n-1}]; a[0] = 1; Table[a[n], {n, 0, 10}] (* Vaclav Kotesovec, Oct 27 2017 *)

CROSSREFS

Sequence in context: A136268 A030242 A037293 * A000896 A103527 A239543

Adjacent sequences:  A129782 A129783 A129784 * A129786 A129787 A129788

KEYWORD

easy,nonn

AUTHOR

Henry Gould, Jun 03 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 20:42 EST 2019. Contains 329323 sequences. (Running on oeis4.)