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.

A255744 a(1) = 1; for n > 1, a(n) = 10*9^(A000120(n-1)-1).

Original entry on oeis.org

1, 10, 10, 90, 10, 90, 90, 810, 10, 90, 90, 810, 90, 810, 810, 7290, 10, 90, 90, 810, 90, 810, 810, 7290, 90, 810, 810, 7290, 810, 7290, 7290, 65610, 10, 90, 90, 810, 90, 810, 810, 7290, 90, 810, 810, 7290, 810, 7290, 7290, 65610, 90, 810, 810, 7290, 810, 7290
Offset: 1

Views

Author

Omar E. Pol, Mar 05 2015

Keywords

Comments

Also, this is a row of the square array A255740.
Partial sums give A255765.

Examples

			Also, written as an irregular triangle in which the row lengths are the terms of A011782, the sequence begins:
1;
10;
10, 90;
10, 90, 90, 810;
10, 90, 90, 810, 90, 810, 810, 7290;
...
		

Crossrefs

Programs

  • Mathematica
    MapAt[Floor, Array[10*9^(DigitCount[# - 1, 2, 1] - 1) &, 54], 1] (* Michael De Vlieger, Nov 03 2022 *)
  • PARI
    a(n) = if (n==1, 1, 10*9^(hammingweight(n-1)-1)); \\ Michel Marcus, Mar 15 2015

Extensions

More terms from Michel Marcus, Mar 15 2015