OFFSET
1,2
COMMENTS
An elephant sequence, see A175654. For the corner squares just one A[5] vector, with decimal value 186, leads to this sequence. For the central square this vector leads to the companion sequence A036563. - Johannes W. Meijer, Aug 15 2010
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
Tamas Lengyel, On p-adic properties of the Stirling numbers of the first kind, Journal of Number Theory, 148 (2015) 73-94.
Index entries for linear recurrences with constant coefficients, signature (4,-5,2).
FORMULA
Binomial transform of [1, 1, 4, 4, 4, ...].
Equals row sums of triangle A131061.
From Johannes W. Meijer, Aug 15 2010; corrected by Colin Barker, Jul 28 2012: (Start)
a(n) = 2^(1+n) - 3*n.
(End)
G.f.: x*(1 - 2*x + 4*x^2)/((1-x)^2*(1-2*x)). - Colin Barker, Jul 28 2012
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3). - Colin Barker, Jul 29 2012
E.g.f.: 2*exp(2*x) - 3*x*exp(x) - 2. - G. C. Greubel, Sep 14 2024
EXAMPLE
a(4) = 20, row sums of 4th row of triangle A131062: (1, 9, 9, 1).
a(4) = 20 = (1, 3, 3, 1) dot (1, 1, 4, 4) = (1 + 3 + 12 + 4).
MATHEMATICA
Table[2^(n+1) - 3*n, {n, 40}] (* Vladimir Joseph Stephan Orlovsky, Nov 15 2008 *)
LinearRecurrence[{4, -5, 2}, {1, 2, 7}, 40] (* Harvey P. Dale, Mar 30 2024 *)
PROG
(Magma) [2^(n+1) -3*n: n in [1..40]]; // G. C. Greubel, Sep 14 2024
(SageMath)
def A123203(n): return 2^(n+1) -3*n
[A123203(n) for n in range(1, 41)] # G. C. Greubel, Sep 14 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Gary W. Adamson, Jun 13 2007
EXTENSIONS
More terms from Vladimir Joseph Stephan Orlovsky, Nov 15 2008
Title changed by G. C. Greubel, Sep 14 2024
STATUS
approved