The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055649 Integers in base 11 with each base 11 digit represented by 2 decimal digits. 3

%I

%S 0,1,2,3,4,5,6,7,8,9,10,100,101,102,103,104,105,106,107,108,109,110,

%T 200,201,202,203,204,205,206,207,208,209,210,300,301,302,303,304,305,

%U 306,307,308,309,310,400,401,402,403,404,405,406,407,408,409,410,500

%N Integers in base 11 with each base 11 digit represented by 2 decimal digits.

%H Matthew House, <a href="/A055649/b055649.txt">Table of n, a(n) for n = 0..10000</a>

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

%F From _Matthew House_, Feb 13 2017: (Start)

%F G.f.: (x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + x^8 + x^9 + x^10 + 90*x^11)/(1 - x - x^11 + x^12).

%F a(n) = a(n-1) + a(n-11) - a(n-12). (End)

%Y Cf. A049872.

%K nonn,base,easy

%O 0,3

%A _Henry Bottomley_, Jun 06 2000

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

Last modified August 3 02:48 EDT 2021. Contains 346435 sequences. (Running on oeis4.)