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.

A131664 A string of n 1's repeated n times.

Original entry on oeis.org

1, 11, 11, 111, 111, 111, 1111, 1111, 1111, 1111, 11111, 11111, 11111, 11111, 11111, 111111, 111111, 111111, 111111, 111111, 111111, 1111111, 1111111, 1111111, 1111111, 1111111, 1111111, 1111111, 11111111, 11111111, 11111111, 11111111
Offset: 1

Views

Author

Paul Curtz, Oct 03 2007

Keywords

Crossrefs

Programs

  • Maple
    seq(((10^n-1)/9)$n, n=1..10); # Robert Israel, Jul 08 2019
  • Python
    from math import isqrt
    def A131664(n): return (10**(isqrt(n<<3)+1>>1)-1)//9 # Chai Wah Wu, Oct 17 2022

Formula

G.f.: z/(1-z) * Sum_{n>=0} 10^n*z^(n*(n+1)/2).