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 A055276 #31 Mar 26 2025 08:30:27
%S A055276 1,10,110,1210,13310,146410,1610510,17715610,194871710,2143588810,
%T A055276 23579476910,259374246010,2853116706110,31384283767210,
%U A055276 345227121439310,3797498335832410,41772481694156510,459497298635721610,5054470284992937710,55599173134922314810,611590904484145462910
%N A055276 First differences of 11^n (A001020).
%C A055276 a(n) is the number of compositions of n when there are 10 types of each natural number. - _Milan Janjic_, Aug 13 2010
%C A055276 Apart from the first term, number of monic squarefree polynomials over F_11 of degree n. - _Charles R Greathouse IV_, Feb 07 2012
%D A055276 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
%H A055276 Milan Janjic, <a href="https://old.pmf.unibl.org/wp-content/uploads/2017/10/enumfun.pdf">Enumerative Formulae for Some Functions on Finite Sets</a>.
%H A055276 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (11).
%F A055276 a(n) = 11*a(n-1) + ((-1)^n)*C(1,1-n).
%F A055276 a(n) = 10*11^(n-1); a(0)=1.
%F A055276 G.f.: (1-x)/(1-11*x).
%F A055276 E.g.f.: (10*exp(11*x) + 1)/11. - _Elmo R. Oliveira_, Mar 18 2025
%t A055276 Table[EulerPhi[11^n],{n,0,40}] (* _Vladimir Joseph Stephan Orlovsky_, Nov 10 2009 *)
%o A055276 (PARI) a(n)=round(11^n*10/11) \\ _Charles R Greathouse IV_, Feb 07 2012
%Y A055276 Cf. A001020.
%K A055276 easy,nonn
%O A055276 0,2
%A A055276 _Barry E. Williams_, May 29 2000
%E A055276 More terms from _Elmo R. Oliveira_, Mar 25 2025