A017341 a(n) = 10*n + 6.
6, 16, 26, 36, 46, 56, 66, 76, 86, 96, 106, 116, 126, 136, 146, 156, 166, 176, 186, 196, 206, 216, 226, 236, 246, 256, 266, 276, 286, 296, 306, 316, 326, 336, 346, 356, 366, 376, 386, 396, 406, 416, 426, 436, 446, 456, 466, 476, 486, 496, 506, 516, 526, 536
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..5000
- Tanya Khovanova, Recursive Sequences.
- S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
- S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, University of Kentucky Research Reports (2004).
- Index entries for linear recurrences with constant coefficients, signature (2,-1).
Programs
-
Magma
[10*n+6: n in [0..60]]; // Vincenzo Librandi, May 29 2011
-
Mathematica
Range[6, 1000, 10] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
-
PARI
a(n)=10*n+6 \\ Charles R Greathouse IV, Jul 10 2016
Formula
a(n) = 2*a(n-1) - a(n-2) with n>1, a(0)=6, a(1)=16. - Vincenzo Librandi, May 29 2011
From Stefano Spezia, May 31 2021: (Start)
G.f.: 2*(3 + 2*x)/(1 - x)^2.
E.g.f.: 2*(3 + 5*x)*exp(x). (End)
Comments