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.

Showing 1-10 of 14 results. Next

A138146 Palindromes with 2n-1 digits formed from the reflected decimal expansion of the concatenation of 1, 1, 1 and infinite 0's.

Original entry on oeis.org

1, 111, 11111, 1110111, 111000111, 11100000111, 1110000000111, 111000000000111, 11100000000000111, 1110000000000000111, 111000000000000000111, 11100000000000000000111
Offset: 1

Views

Author

Omar E. Pol, Mar 29 2008, May 18 2008

Keywords

Comments

Bisection of A138145.
a(n) is also A147597(n) written in base 2. [Omar E. Pol, Nov 08 2008]

Examples

			n ............ a(n)
1 ............. 1
2 ............ 111
3 ........... 11111
4 .......... 1110111
5 ......... 111000111
6 ........ 11100000111
7 ....... 1110000000111
8 ...... 111000000000111
9 ..... 11100000000000111
10 ... 1110000000000000111
		

Crossrefs

Programs

  • Mathematica
    Table[FromDigits@ If[n < 4, ConstantArray[1, 2 n - 1], Join[#, ConstantArray[0, 2 n - 7], #]] &@ ConstantArray[1, 3], {n, 14}] (* or *)
    Rest@ CoefficientList[Series[-x (10 x - 1) (10 x + 1) (100 x^2 + 10 x + 1)/((x - 1) (100 x - 1)), {x, 0, 14}], x] (* Michael De Vlieger, Nov 25 2016 *)
  • PARI
    Vec(-x*(10*x-1)*(10*x+1)*(100*x^2+10*x+1)/((x-1)*(100*x-1)) + O(x^100)) \\ Colin Barker, Sep 16 2013

Formula

From Colin Barker, Sep 16 2013: (Start)
a(n) = 111 + 111*100^(n-2) for n>3.
a(n) = 101*a(n-1) - 100*a(n-2) for n>5.
G.f.: -x*(10*x-1)*(10*x+1)*(100*x^2+10*x+1) / ((x-1)*(100*x-1)). (End)

Extensions

Better definition from Omar E. Pol, Nov 16 2008

A138120 Concatenation of n digits 1, 2n-1 digits 0 and n digits 1.

Original entry on oeis.org

101, 1100011, 11100000111, 111100000001111, 1111100000000011111, 11111100000000000111111, 111111100000000000001111111, 1111111100000000000000011111111, 11111111100000000000000000111111111, 111111111100000000000000000001111111111
Offset: 1

Views

Author

Omar E. Pol, Apr 06 2008

Keywords

Comments

a(n) has 4n-1 digits.
a(n) is also A147539(n) written in base 2. [Omar E. Pol, Nov 08 2008]

Examples

			n ........... a(n)
1 ........... 101
2 ......... 1100011
3 ....... 11100000111
4 ..... 111100000001111
5 ... 1111100000000011111
		

Crossrefs

Programs

  • Maple
    a:= n-> parse(cat(1$n,0$(2*n-1),1$n)):
    seq(a(n), n=1..11);  # Alois P. Heinz, Mar 03 2022
  • Mathematica
    Table[FromDigits[Join[PadRight[{},n,1],PadRight[{},2n-1,0], PadRight[ {},n,1]]],{n,10}] (* or *) LinearRecurrence[{11011,-10121010,110110000,-100000000},{101,1100011,11100000111,111100000001111},10] (* Harvey P. Dale, Mar 19 2016 *)
  • PARI
    Vec(x*(10001000*x^2-12100*x+101)/((x-1)*(10*x-1)*(1000*x-1)*(10000*x-1)) + O(x^100)) \\ Colin Barker, Sep 16 2013
    
  • Python
    def a(n): return int("1"*n + "0"*(2*n-1) + "1"*n)
    print([a(n) for n in range(1, 11)]) # Michael S. Branicky, Mar 03 2022

Formula

G.f.: x*(10001000*x^2-12100*x+101) / ((x-1)*(10*x-1)*(1000*x-1)*(10000*x-1)). [Colin Barker, Sep 16 2013]

A138145 Palindromes formed from the reflected decimal expansion of the concatenation of 1, 1, 1 and infinite 0's.

Original entry on oeis.org

1, 11, 111, 1111, 11111, 111111, 1110111, 11100111, 111000111, 1110000111, 11100000111, 111000000111, 1110000000111, 11100000000111, 111000000000111, 1110000000000111, 11100000000000111, 111000000000000111
Offset: 1

Views

Author

Omar E. Pol, Mar 29 2008

Keywords

Comments

a(n) is also A147596(n) written in base 2. - Omar E. Pol, Nov 08 2008

Examples

			n .... a(n)
1 .... 1
2 .... 11
3 .... 111
4 .... 1111
5 .... 11111
6 .... 111111
7 .... 1110111
8 .... 11100111
9 .... 111000111
10 ... 1110000111
11 ... 11100000111
12 ... 111000000111
13 ... 1110000000111
		

Crossrefs

Programs

  • Mathematica
    Table[If[n < 7, (10^n - 1)/9, 111 + 111*10^(n-3)], {n, 25}] (* or *)
    LinearRecurrence[{11, -10}, {1, 11, 111, 1111, 11111, 111111, 1110111}, 25] (* Paolo Xausa, Aug 08 2024 *)
  • PARI
    Vec(-x*(10*x^2-1)*(100*x^4+10*x^2+1)/((x-1)*(10*x-1)) + O(x^100)) \\ Colin Barker, Sep 15 2013

Formula

From Colin Barker, Sep 15 2013: (Start)
a(n) = 111+111*10^(n-3) for n>5.
a(n) = 11*a(n-1)-10*a(n-2).
G.f.: -x*(10*x^2-1)*(100*x^4+10*x^2+1) / ((x-1)*(10*x-1)). (End)

Extensions

Better definition from Omar E. Pol, Nov 16 2008

A138144 Palindromes formed from the reflected decimal expansion of the concatenation of 1, 1 and infinite 0's.

Original entry on oeis.org

1, 11, 111, 1111, 11011, 110011, 1100011, 11000011, 110000011, 1100000011, 11000000011, 110000000011, 1100000000011, 11000000000011, 110000000000011, 1100000000000011, 11000000000000011, 110000000000000011
Offset: 1

Views

Author

Omar E. Pol, Mar 29 2008

Keywords

Comments

a(n) is also A147595(n) written in base 2. [From Omar E. Pol, Nov 08 2008]

Examples

			n .... a(n)
1 .... 1
2 .... 11
3 .... 111
4 .... 1111
5 .... 11011
6 .... 110011
7 .... 1100011
8 .... 11000011
9 .... 110000011
10 ... 1100000011
		

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{11,-10},{1,11,111,1111,11011},20] (* Harvey P. Dale, Aug 21 2016 *)
  • PARI
    Vec(-x*(10*x^2-1)*(10*x^2+1)/((x-1)*(10*x-1)) + O(x^100)) \\ Colin Barker, Sep 15 2013

Formula

a(n) = 11+11*10^(n-2) for n>3. a(n) = 11*a(n-1)-10*a(n-2). G.f.: -x*(10*x^2-1)*(10*x^2+1) / ((x-1)*(10*x-1)). - Colin Barker, Sep 15 2013

Extensions

Better definition. - Omar E. Pol, Nov 15 2008

A138826 Concatenation of 2n-1 digits 1, n digits 0 and 2n-1 digits 1.

Original entry on oeis.org

101, 11100111, 1111100011111, 111111100001111111, 11111111100000111111111, 1111111111100000011111111111, 111111111111100000001111111111111, 11111111111111100000000111111111111111
Offset: 1

Views

Author

Omar E. Pol, Apr 06 2008

Keywords

Comments

a(n) has 5n-2 digits.
a(n) is also A147540(n) written in base 2. [Omar E. Pol, Nov 08 2008]

Examples

			n ........... a(n)
1 ........... 101
2 ......... 11100111
3 ....... 1111100011111
4 ..... 111111100001111111
5 ... 11111111100000111111111
		

Crossrefs

Programs

  • Mathematica
    Table[(1000^n + 10)*(100^n - 10)/900, {n, 10}] (* Paolo Xausa, Aug 08 2024 *)
  • PARI
    Vec(x*(1100000000*x^3-2000000*x^2+888910*x+101)/((x-1)*(100*x-1)*(1000*x-1)*(100000*x-1)) + O(x^100)) \\ Colin Barker, Sep 16 2013

Formula

a(n) = (10^(2n-1)-1+10^(5n-2)-10^(3n-1))/9. [R. J. Mathar, Nov 07 2008, corrected Nov 09 2008]
G.f.: x*(1100000000*x^3-2000000*x^2+888910*x+101) / ((x-1)*(100*x-1)*(1000*x-1)*(100000*x-1)). - Colin Barker, Sep 16 2013

A138118 Concatenation of 2n-1 digits 1 and n digits 0.

Original entry on oeis.org

10, 11100, 11111000, 11111110000, 11111111100000, 11111111111000000, 11111111111110000000, 11111111111111100000000, 11111111111111111000000000, 11111111111111111110000000000
Offset: 1

Views

Author

Omar E. Pol, Mar 29 2008

Keywords

Comments

a(n) is also A147537(n) written in base 2. [From Omar E. Pol, Nov 08 2008]

Examples

			n .......... a(n)
1 ........... 10
2 ......... 11100
3 ....... 11111000
4 ..... 11111110000
5 ... 11111111100000
		

Crossrefs

Programs

  • Mathematica
    FromDigits/@Table[Join[PadRight[{},2n-1,1],PadRight[{},n,0]],{n,15}] (* Harvey P. Dale, Dec 09 2011 *)

Formula

O.g.f.: 10*(1+100x)/[(-1+1000x)*(-1+10x)]. a(n)=A100706(n)*10^n = 10*a(n-1)+11*1000^n. - R. J. Mathar, Apr 03 2008

A138119 Concatenation of n digits 1 and 2*n-1 digits 0.

Original entry on oeis.org

10, 11000, 11100000, 11110000000, 11111000000000, 11111100000000000, 11111110000000000000, 11111111000000000000000, 11111111100000000000000000, 11111111110000000000000000000, 11111111111000000000000000000000, 11111111111100000000000000000000000
Offset: 1

Views

Author

Omar E. Pol, Apr 03 2008

Keywords

Comments

a(n) has 3*n-1 digits.
a(n) is also A147538(n) written in base 2. - Omar E. Pol, Nov 08 2008.

Examples

			n ...... a(n)
1 ....... 10
2 ...... 11000
3 ..... 11100000
4 .... 11110000000
5 ... 11111000000000
		

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{1100, -100000}, {10, 11000}, 15] (* Paolo Xausa, Feb 06 2024 *)
  • PARI
    Vec(10*x/((100*x-1)*(1000*x-1)) + O(x^100)) \\ Colin Barker, Sep 16 2013

Formula

From Colin Barker, Sep 16 2013: (Start)
a(n) = 1100*a(n-1) - 100000*a(n-2).
G.f.: 10*x / ((100*x-1)*(1000*x-1)). (End)

A138147 Concatenation of n digits 1 and n digits 0.

Original entry on oeis.org

10, 1100, 111000, 11110000, 1111100000, 111111000000, 11111110000000, 1111111100000000, 111111111000000000, 11111111110000000000, 1111111111100000000000, 111111111111000000000000, 11111111111110000000000000, 1111111111111100000000000000, 111111111111111000000000000000
Offset: 1

Views

Author

Omar E. Pol, Mar 29 2008

Keywords

Comments

Also, a(n) = binary representation of A020522(n), for n>0 (see example).

Examples

			n ... A020522(n) ..... a(n)
1 ....... 2 ........... 10
2 ...... 12 .......... 1100
3 ...... 56 ......... 111000
4 ..... 240 ........ 11110000
5 ..... 992 ....... 1111100000
6 .... 4032 ...... 111111000000
7 ... 16256 ..... 11111110000000
		

References

  • J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 136, Ex. 4.2.2. - N. J. A. Sloane, Jul 27 2012

Crossrefs

Programs

  • Magma
    [(10^(2*n) - 10^n)/9: n in [1..30]]; // Vincenzo Librandi, Apr 26 2011
    
  • Mathematica
    Table[FromDigits[Join[PadRight[{},n,1],PadRight[{},n,0]]],{n,15}] (* Harvey P. Dale, Nov 20 2011 *)
  • PARI
    Vec(10*x/((10*x-1)*(100*x-1)) + O(x^100)) \\ Colin Barker, Sep 16 2013

Formula

a(n) = (10^(2*n) - 10^n)/9 = A002275(n)*10^n. - Omar E. Pol, Apr 16 2008
a(n) = 10*A109241(n-1). - Omar E. Pol, Nov 08 2008
From Colin Barker, Sep 16 2013: (Start)
a(n) = 110*a(n-1) - 1000*a(n-2).
G.f.: 10*x/((10*x-1)*(100*x-1)). (End)
From Elmo R. Oliveira, Jun 13 2025: (Start)
E.g.f.: exp(10*x)*(exp(90*x) - 1)/9.
a(n) = A276352(n)/9. (End)

A147759 Palindromes formed from the reflected decimal expansion of the infinite concatenation of 1's and 0's.

Original entry on oeis.org

1, 11, 101, 1001, 10101, 101101, 1010101, 10100101, 101010101, 1010110101, 10101010101, 101010010101, 1010101010101, 10101011010101, 101010101010101, 1010101001010101, 10101010101010101, 101010101101010101
Offset: 1

Views

Author

Omar E. Pol, Nov 11 2008

Keywords

Comments

a(k(n)) is divisible by 3 iff k(n) is defined by k(1) = 5 and k(n+1) - k(n) = A100285(n+2). - Altug Alkan, Dec 05 2015

Examples

			n .... Successive digits of a(n)
1 ............. ( 1 )
2 ............ ( 1 1 )
3 ........... ( 1 0 1 )
4 .......... ( 1 0 0 1 )
5 ......... ( 1 0 1 0 1 )
6 ........ ( 1 0 1 1 0 1 )
7 ....... ( 1 0 1 0 1 0 1 )
8 ...... ( 1 0 1 0 0 1 0 1 )
9 ..... ( 1 0 1 0 1 0 1 0 1 )
10 ... ( 1 0 1 0 1 1 0 1 0 1 )
		

Crossrefs

Programs

  • Magma
    I:=[1,11,101,1001]; [n le 4 select I[n] else 11*Self(n-1)-20*Self(n-2)+110*Self(n-3)-100*Self(n-4): n in [1..30]]; // Vincenzo Librandi, Dec 05 2015
  • Mathematica
    CoefficientList[Series[x/((1 - x) (1 - 10 x) (1 + 10 x^2)),{x, 0, 20}], x] (* Vincenzo Librandi, Dec 05 2015 *)
    LinearRecurrence[{11,-20,110,-100},{1,11,101,1001},30] (* Harvey P. Dale, Apr 10 2022 *)
  • PARI
    Vec(x/((1-x)*(1-10*x)*(1+10*x^2)) + O(x^30)) \\ Michel Marcus, Dec 05 2015
    

Formula

From R. J. Mathar, Feb 20 2009: (Start)
a(n) = 11*a(n-1)-20*a(n-2)+110*a(n-3)-100*a(n-4).
G.f.: x/((1-x)*(1-10*x)*(1+10*x^2)). (End)
E.g.f.: (exp(x)*(10*exp(9*x) - 1) - 9*cos(sqrt(10)*x))/99. - Stefano Spezia, Oct 12 2024

A147757 Palindromes formed from the reflected decimal expansion of the concatenation of 1, 0 and infinite digits 1.

Original entry on oeis.org

1, 11, 101, 1001, 10101, 101101, 1011101, 10111101, 101111101, 1011111101, 10111111101, 101111111101, 1011111111101, 10111111111101, 101111111111101, 1011111111111101, 10111111111111101, 101111111111111101
Offset: 1

Views

Author

Omar E. Pol, Nov 11 2008

Keywords

Comments

a(n) is also A147758(n) written in base 2.
a(A016789(n)) is divisible by 3 for n > 0. - Altug Alkan, Dec 06 2015

Examples

			n .... Successive digits of a(n)
1 ............. ( 1 )
2 ............ ( 1 1 )
3 ........... ( 1 0 1 )
4 .......... ( 1 0 0 1 )
5 ......... ( 1 0 1 0 1 )
6 ........ ( 1 0 1 1 0 1 )
7 ....... ( 1 0 1 1 1 0 1 )
8 ...... ( 1 0 1 1 1 1 0 1 )
9 ..... ( 1 0 1 1 1 1 1 0 1 )
10 ... ( 1 0 1 1 1 1 1 1 0 1 )
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{w = {1, 0}}, Which[n == 1, w = {1}, n == 2, w = {1, 1}, n == 3, AppendTo[w, 1], n >= 4, w = Join[w, Table[1, {n - 4}], Reverse@ w]]; FromDigits@ w]; Array[f, 19] (* Michael De Vlieger, Dec 05 2015 *)
    LinearRecurrence[{11,-10},{1,11,101,1001,10101},20] (* Harvey P. Dale, Aug 02 2017 *)
  • PARI
    Vec( x+11*x^2+101*x^3 -91*x^4*(-11+10*x) / ( (10*x-1)*(x-1) ) + O(x^30)) \\ Michel Marcus, Dec 05 2015

Formula

G.f.: x+11*x^2+101*x^3-91*x^4*(-11+10*x) / ( (10*x-1)*(x-1) ). - R. J. Mathar, Aug 24 2011
a(n) = 11*a(n-1) - 10*a(n-2) for n>2. Wesley Ivan Hurt, Dec 06 2015
Showing 1-10 of 14 results. Next