|
%I #25 Dec 12 2023 07:43:54
%S 0,1,6,7,2,3,8,9,4,5,0,1,6,7,2,3,8,9,4,5,0,1,6,7,2,3,8,9,4,5,0,1,6,7,
%T 2,3,8,9,4,5,0,1,6,7,2,3,8,9,4,5,0,1,6,7,2,3,8,9,4,5,0,1,6,7,2,3,8,9,
%U 4,5,0,1,6,7,2,3,8,9,4,5,0,1,6,7,2,3,8,9,4,5
%N Period 10: repeat 0, 1, 6, 7, 2, 3, 8, 9, 4, 5.
%C The repeating part contains all ten digits.
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,1).
%F a(n) = A171507(n+1) mod 10.
%F a(2n) = A059629(n) mod 10; a(2n+1) = A139788(n).
%F abs(a(n+1)-a(n)) = A010686(n).
%F G.f.: -x*(1 + 6*x + 7*x^2 + 2*x^3 + 3*x^4 + 8*x^5 + 9*x^6 + 4*x^7 + 5*x^8) / ( (x-1)*(1+x)*(x^4 + x^3 + x^2 + x + 1)*(x^4 - x^3 + x^2 - x + 1) ). - _R. J. Mathar_, Jul 13 2011
%K nonn,easy
%O 0,3
%A _Paul Curtz_, Dec 14 2009
%E More terms from _Jinyuan Wang_, Feb 26 2020
|
