This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A047332 #24 May 29 2025 13:01:27
%S A047332 0,2,3,5,6,7,9,10,12,13,14,16,17,19,20,21,23,24,26,27,28,30,31,33,34,
%T A047332 35,37,38,40,41,42,44,45,47,48,49,51,52,54,55,56,58,59,61,62,63,65,66,
%U A047332 68,69,70,72,73,75,76,77,79,80,82,83,84,86,87,89,90,91,93,94,96,97
%N A047332 Numbers that are congruent to {0, 2, 3, 5, 6} mod 7.
%H A047332 Paolo Xausa, <a href="/A047332/b047332.txt">Table of n, a(n) for n = 1..10000</a>
%H A047332 Melvyn B. Nathanson, <a href="http://dx.doi.org/10.4169/amer.math.monthly.120.05.409">On the fractional parts of roots of positive real numbers</a>, Amer. Math. Monthly, 120 (2013), 409-429 [see p. 417].
%H A047332 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1).
%F A047332 a(n) = a(n-5)+7. O.g.f.: x^2*(2+x+2*x^2+x^3+x^4)/((-1+x)^2*(x^4+x^3+x^2+x+1)). - _R. J. Mathar_, Apr 19 2008
%F A047332 a(n) = floor((7*n-3)/5). - _Jason Yuen_, May 27 2025
%t A047332 Floor[(7*Range[100] - 3)/5] (* _Paolo Xausa_, May 29 2025 *)
%K A047332 nonn,easy
%O A047332 1,2
%A A047332 _N. J. A. Sloane_