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 A275910 #13 Oct 08 2017 18:46:00
%S A275910 2,3,4,5,6,7,11,12,13,14,15,16,20,21,22,23,24,25,29,30,31,32,33,34,38,
%T A275910 39,40,41,42,43,47,48,49,50,51,52,56,57,58,59,60,61,65,66,67,68,69,70,
%U A275910 74,75,76,77,78,79,83,84,85,86,87,88,92,93,94,95,96,97,101,102,103,104,105,106,110,111
%N A275910 Numbers not congruent to 0, 1 or 8 mod 9.
%D A275910 H. I. Okagbue, M. O. Adamu, S. A. Bishop and A. A. Opanuga, Properties of Sequences Generated by Summing the Digits of Cubed Positive Integers, Indian Journal Of Natural Sciences, Vol. 6 / Issue 32 / October 2015.
%H A275910 Colin Barker, <a href="/A275910/b275910.txt">Table of n, a(n) for n = 1..1000</a>
%H A275910 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,1,-1).
%F A275910 From _Colin Barker_, Aug 26 2016: (Start)
%F A275910 a(n) = a(n-1)+a(n-6)-a(n-7) for n>7.
%F A275910 G.f.: x*(2+x+x^2+x^3+x^4+x^5+2*x^6) / ((1-x)^2*(1+x)*(1-x+x^2)*(1+x+x^2)). (End)
%t A275910 DeleteCases[Range[120],_?(MemberQ[{0,1,8},Mod[#,9]]&)] (* _Harvey P. Dale_, Oct 08 2017 *)
%o A275910 (PARI) Vec(x*(2+x+x^2+x^3+x^4+x^5+2*x^6)/((1-x)^2*(1+x)*(1-x+x^2)*(1+x+x^2)) + O(x^100)) \\ _Colin Barker_, Aug 26 2016
%Y A275910 Complement of A054966.
%K A275910 nonn,easy
%O A275910 1,1
%A A275910 _N. J. A. Sloane_, Aug 26 2016