login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155872 a(n) = 10^n + 11^n. 2

%I #17 Sep 08 2022 08:45:41

%S 2,21,221,2331,24641,261051,2771561,29487171,314358881,3357947691,

%T 35937424601,385311670611,4138428376721,44522712143931,

%U 479749833583241,5177248169415651,55949729863572161,605447028499293771

%N a(n) = 10^n + 11^n.

%C a(n) gives the combined total number of n digit numbers [preceding zeros allowed] in base 10 and 11

%H Vincenzo Librandi, <a href="/A155872/b155872.txt">Table of n, a(n) for n = 0..900</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (21,-110).

%F G.f.: 1/(1-10*x) + 1/(1-11*x). - _Vincenzo Librandi_, Feb 06 2013

%t CoefficientList[Series[1/(1 - 10 x) + 1/(1 - 11 x), {x, 0, 30}], x] (* _Vincenzo Librandi_, Feb 06 2013 *)

%t LinearRecurrence[{21,-110},{2,21},20] (* _Harvey P. Dale_, Aug 27 2020 *)

%o (Magma) [10^n+11^n: n in [0..30]]; // _Vincenzo Librandi_, Feb 06 2013

%K nonn,easy

%O 0,1

%A Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 29 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 09:32 EDT 2024. Contains 371268 sequences. (Running on oeis4.)