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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060719 a(0) = 1; a(n+1) = a(n) + Sum_{i=0..n} binomial(n,i)*(a(i)+1). 5
1, 3, 9, 29, 103, 405, 1753, 8279, 42293, 231949, 1357139, 8427193, 55288873, 381798643, 2765917089, 20960284293, 165729739607, 1364153612317, 11665484410113, 103448316470743, 949739632313501, 9013431476894645, 88304011710168691 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Cf. A186021

LINKS

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

FORMULA

a(n) = 2*Bell(n+1)-1. - Vladeta Jovovic, Feb 11 2003

Equals the binomial transform of A186021. Also, a(n) = A186021(n+1) - 1. - Gary W. Adamson May 20 2013

EXAMPLE

a(3) = 29 = (30 - 1) = A186021(4) - 1

MAPLE

A060719 := proc(n) option remember; local i; if n=0 then 1 else A060719(n-1)+add(binomial(n-1, i)*(A060719(i)+1), i=0..n-1); fi; end;

CROSSREFS

Cf. A000110.

Cf. A186021.

Sequence in context: A148943 A148944 A293070 * A091152 A148945 A177255

Adjacent sequences:  A060716 A060717 A060718 * A060720 A060721 A060722

KEYWORD

easy,nonn

AUTHOR

Frank Ellermann, Apr 23 2001

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 13:45 EDT 2018. Contains 316379 sequences. (Running on oeis4.)