cp's OEIS Frontend

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.

A016123 a(n) = (11^(n+1) - 1)/10.

This page as a plain text file.
%I A016123 #54 Mar 14 2025 15:05:19
%S A016123 1,12,133,1464,16105,177156,1948717,21435888,235794769,2593742460,
%T A016123 28531167061,313842837672,3452271214393,37974983358324,
%U A016123 417724816941565,4594972986357216,50544702849929377,555991731349223148
%N A016123 a(n) = (11^(n+1) - 1)/10.
%C A016123 11^a(n) is highest power of 11 dividing (11^(n+1))!.
%C A016123 Partial sums of powers of 11 (A001020).
%C A016123 Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=11, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n-1)=det(A). - _Milan Janjic_, Feb 21 2010
%C A016123 Let A be the Hessenberg matrix of the order n, defined by: A[1,j]=1, A[i,i]:=12, (i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=2, a(n-1)=(-1)^n*charpoly(A,1). - _Milan Janjic_, Feb 21 2010
%H A016123 G. C. Greubel, <a href="/A016123/b016123.txt">Table of n, a(n) for n = 0..950</a>
%H A016123 D. C. Santos, E. A. Costa, and P. M. M. C. Catarino, <a href="https://doi.org/10.3390/axioms14030203">On Gersenne Sequence: A Study of One Family in the Horadam-Type Sequence</a>, Axioms 14, 203, (2025). See p. 4.
%H A016123 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a>
%H A016123 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-11).
%F A016123 a(n) = Sum_{k=0..n} 11^k = (11^(n+1) - 1)/10.
%F A016123 G.f.: (1/(1-11*x) - 1/(1-x))/(10*x) = 1/((1-11*x)*(1-x)).
%F A016123 a(0)=1, a(n) = 11*a(n-1) + 1. - _Vincenzo Librandi_, Feb 05 2011
%F A016123 a(0)=0, a(1)=1, a(n) = 12*a(n-1) - 11*a(n-2). - _Harvey P. Dale_, Apr 05 2012
%F A016123 E.g.f.: exp(x)*(11*exp(10*x) - 1)/10. - _Stefano Spezia_, Mar 11 2023
%t A016123 (11^Range[0,20]-1)/10 (* or *) LinearRecurrence[{12,-11},{0,1},20] (* _Harvey P. Dale_, Apr 05 2012 *)
%o A016123 (Sage) [lucas_number1(n,12,11) for n in range(1, 19)] # _Zerinvary Lajos_, Apr 27 2009
%o A016123 (Sage) [gaussian_binomial(n,1,11) for n in range(1,19)] # _Zerinvary Lajos_, May 28 2009
%o A016123 (Maxima) A016123(n):=(11^(n+1)-1)/10$
%o A016123 makelist(A016123(n),n,0,30); /* _Martin Ettl_, Nov 05 2012 */
%o A016123 (PARI) a(n)=(11^(n+1)-1)/10 \\ _Charles R Greathouse IV_, Sep 24 2015
%o A016123 (Magma) [(11^(n+1)-1)/10: n in [0..30]]; // _G. C. Greubel_, Feb 21 2024
%Y A016123 For analogs with primes 2, 3, 5, 7, 13 and 17 see: A000225, A003462, A003463, A023000, A091030 and A091045, respectively.
%Y A016123 Cf. A001020, A004191.
%K A016123 nonn,easy
%O A016123 0,2
%A A016123 _N. J. A. Sloane_
%E A016123 Title edited by _Daniel Forgues_, Jul 08 2011