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!)
A027261 a(n) = Sum_{k=0..2n} (k+1) * A025177(n, k). 5
1, 4, 18, 72, 270, 972, 3402, 11664, 39366, 131220, 433026, 1417176, 4605822, 14880348, 47829690, 153055008, 487862838, 1549681956, 4907326194, 15496819560, 48814981614, 153418513644, 481176247338, 1506290861232, 4707158941350, 14686335897012, 45753584909922 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 2(n+1)*3^(n-1), for n>1 (conjectured). - Ralf Stephan, Feb 02 2004
From Colin Barker, Jul 28 2012: (Start)
Conjecture: a(n) = 6*a(n-1)-9*a(n-2), for n>3.
G.f.: (1-9*x^2+18*x^3)/(1-3*x)^2. (End)
CROSSREFS
Cf. A006234.
Sequence in context: A034352 A358463 A159715 * A290919 A218892 A307566
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(1) corrected and more terms from Sean A. Irvine, Oct 26 2019
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 05:26 EDT 2024. Contains 371918 sequences. (Running on oeis4.)