|
Search: id:A091914
|
|
| |
|
| 1, 2, 16, 56, 304, 1280, 6208, 27776, 130048, 593408, 2747392, 12615680, 58200064, 267788288, 1233977344, 5681414144, 26170556416, 120518082560, 555082842112, 2556382674944, 11773759455232, 54224111009792, 249733335482368
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n)=A000079(n)*A006130(n). Binomial transform of 1,1,13,13,169,169,.... The inverse binomial transform of 2^n*c(n), where c(n) is the solution to c(n)=c(n-1)+kc(n-2), a(0)=1,a(1)=1 is 1,1,4k+1,4k+1,(4k+1)^2,...
|
|
FORMULA
|
G.f.: (1/(1-2x-12x^2); a(n)=((1+sqrt(13))(1+sqrt(13))^n-(1-sqrt(13))(1-sqrt(13))^n)/(2sqrt(13)).
a(n)=sum{k=0..floor(n/2), C(n+1,2k+1)13^k}; - Paul Barry (pbarry(AT)wit.ie), Jan 15 2007
|
|
CROSSREFS
|
Cf. A003683, A063727.
Adjacent sequences: A091911 A091912 A091913 this_sequence A091915 A091916 A091917
Sequence in context: A027273 A033431 A107610 this_sequence A123791 A061608 A076616
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Feb 12 2004
|
|
|
Search completed in 0.002 seconds
|
