A374359 a(1) = 2, a(n) = 5 for n > 1.
2, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 1
Examples
2.555555555555555555555555555555555555555...
Links
- Greg Martin and Winnie Miao, abc triples, arXiv:1409.2974 [math.NT], 2014. See p. 5.
- Index entries for linear recurrences with constant coefficients, signature (1).
Crossrefs
Programs
-
Mathematica
LinearRecurrence[{1},{2,5},100]
Formula
G.f.: x*(2 + 3*x)/(1 - x).
a(n) = a(n-1) for n > 2.
E.g.f.: 5*exp(x) - 3*x - 5.
Comments