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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141351 a(n)=C(n)+1-0^n where C(n)=A000108(n). 6

%I

%S 1,2,3,6,15,43,133,430,1431,4863,16797,58787,208013,742901,2674441,

%T 9694846,35357671,129644791,477638701,1767263191,6564120421,

%U 24466267021,91482563641,343059613651,1289904147325

%N a(n)=C(n)+1-0^n where C(n)=A000108(n).

%C Hankel transform is A141352.

%F G.f.: c(x)+x/(1-x), where c(x) is the g.f. of A000108.

%F 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

%Y Cf. A141353.

%K easy,nonn

%O 0,2

%A _Paul Barry_, Jun 27 2008

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 June 17 22:14 EDT 2021. Contains 345086 sequences. (Running on oeis4.)