# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a324471
Showing 1-1 of 1

%I A324471 #24 Aug 03 2024 18:16:23
%S A324471 0,0,1,2,0,4,3,2,1,0,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%T A324471 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U A324471 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N A324471 a(n) = 10 mod n.
%H A324471 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F A324471 From _Elmo R. Oliveira_, Aug 03 2024: (Start)
%F A324471 G.f.: x^3*(1 + x - 2*x^2 + 4*x^3 - x^4 - x^5 - x^6 - x^7 + 10*x^8)/(1 - x).
%F A324471 a(n) = 10 for n > 10. (End)
%t A324471 Mod[10,Range[100]] (* _Paolo Xausa_, Nov 14 2023 *)
%Y A324471 Cf. A010692, A010879, A048158, A051127, A090976, A324472.
%K A324471 nonn,easy
%O A324471 1,4
%A A324471 _N. J. A. Sloane_, Mar 07 2019, following a suggestion from _Charles Kusniec_

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE