OFFSET
1,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
MathWorld, Diophantine equation
Wikipedia, Diophantine equation
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,6,-6,0,0,0,0,0,0,0,-1,1).
FORMULA
G.f.: x^2*(31*x^17 +89*x^16 +76*x^15 +23*x^14 +73*x^13 +23*x^12 +76*x^11 +89*x^10 +31*x^9 -153*x^8 -411*x^7 -304*x^6 -81*x^5 -219*x^4 -57*x^3 -152*x^2 -123*x -33)/((x -1)*(x^18 -6*x^9 +1)). [Colin Barker, Aug 05 2012]
a(n) = a(n-1)+6*a(n-9)-6*a(n-10)-a(n-18)+a(n-19). - Wesley Ivan Hurt, May 31 2021
MATHEMATICA
LinearRecurrence[ {1, 0, 0, 0, 0, 0, 0, 0, 6, -6, 0, 0, 0, 0, 0, 0, 0, -1, 1}, {0, 33, 156, 308, 365, 584, 665, 969, 1380, 1533, 1700, 2349, 3185, 3504, 4745, 5208, 6956, 9333, 10220}, 50]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vladimir Joseph Stephan Orlovsky, Feb 14 2012
STATUS
approved