login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038559 a(n) = 2*A040027(n-1) + Bell(n), where Bell = A000110. 4
1, 3, 4, 11, 33, 114, 445, 1923, 9078, 46369, 254297, 1487896, 9239135, 60615819, 418583924, 3032405831, 22979752405, 181697363626, 1495586215841, 12789423056183, 113415288869750, 1041244540823413, 9881851825756365, 96811870321650792, 977851660102425867 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
H. W. Gould & J. Quaintance, A linear binomial recurrence and the Bell numbers and polynomials, Applic. Anal. Discr. Math 1 (2007) 371-385.
FORMULA
a(0) = 1, a(1) = 3; a(n) = Sum_{k=1..n} binomial(n-1,k-1) * a(n-k). - Ilya Gutkovskiy, Jul 10 2020
MAPLE
A038559 := proc(n)
2*A040027(n-1)+combinat[bell](n) ;
end proc: # R. J. Mathar, Dec 20 2013
alias(PS = ListTools:-PartialSums):
A038559List := proc(len) local a, k, P, T; a := 3; P := [1]; T := [1];
for k from 1 to len-1 do
T := [op(T), a]; P := PS([a, op(P)]); a := P[-1] od;
T end: A038559List(25); # Peter Luschny, Mar 28 2022
CROSSREFS
Sequence in context: A019169 A049979 A084378 * A242044 A344263 A275309
KEYWORD
easy,nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:13 EDT 2024. Contains 371960 sequences. (Running on oeis4.)