The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141351 a(n)=C(n)+1-0^n where C(n)=A000108(n). 6
 1, 2, 3, 6, 15, 43, 133, 430, 1431, 4863, 16797, 58787, 208013, 742901, 2674441, 9694846, 35357671, 129644791, 477638701, 1767263191, 6564120421, 24466267021, 91482563641, 343059613651, 1289904147325 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Hankel transform is A141352. LINKS FORMULA G.f.: c(x)+x/(1-x), where c(x) is the g.f. of A000108. Conjecture: (n+1)*a(n) +2*(-3*n+1)*a(n-1) +(9*n-13)*a(n-2) +2*(-2*n+5)*a(n-3)=0. - R. J. Mathar, Oct 15 2014 CROSSREFS Cf. A141353. Sequence in context: A036418 A120589 A110181 * A088793 A322197 A216144 Adjacent sequences:  A141348 A141349 A141350 * A141352 A141353 A141354 KEYWORD easy,nonn AUTHOR Paul Barry, Jun 27 2008 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.

Last modified May 17 06:30 EDT 2021. Contains 343965 sequences. (Running on oeis4.)