A017305 a(n) = 10*n + 3.
3, 13, 23, 33, 43, 53, 63, 73, 83, 93, 103, 113, 123, 133, 143, 153, 163, 173, 183, 193, 203, 213, 223, 233, 243, 253, 263, 273, 283, 293, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 403, 413, 423, 433, 443, 453, 463, 473, 483, 493, 503, 513, 523, 533
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..5000
- Tanya Khovanova, Recursive Sequences.
- William A. Stein, Dimensions of the spaces S_k(Gamma_0(N)).
- William A. Stein, The modular forms database.
- Index entries for linear recurrences with constant coefficients, signature (2,-1).
Programs
-
Magma
[10*n+3: n in [0..60]]; // Vincenzo Librandi, May 28 2011
-
Mathematica
Range[3, 1000, 10] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
Formula
a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, May 28 2011
G.f.: (3+7*x)/(x-1)^2. - R. J. Mathar, Apr 11 2016
E.g.f.: exp(x)*(3 + 10*x). - Stefano Spezia, Aug 22 2023
a(n) = A016885(2*n). - Elmo R. Oliveira, Apr 10 2025
Comments