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!)
A255744 a(1) = 1; for n > 1, a(n) = 10*9^(A000120(n-1)-1). 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also, this is a row of the square array A255740.
Partial sums give A255765.
LINKS
EXAMPLE
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;
...
MATHEMATICA
MapAt[Floor, Array[10*9^(DigitCount[# - 1, 2, 1] - 1) &, 54], 1] (* Michael De Vlieger, Nov 03 2022 *)
PROG
(PARI) a(n) = if (n==1, 1, 10*9^(hammingweight(n-1)-1)); \\ Michel Marcus, Mar 15 2015
CROSSREFS
Sequence in context: A243126 A269921 A219797 * A165831 A102377 A286507
KEYWORD
nonn
AUTHOR
Omar E. Pol, Mar 05 2015
EXTENSIONS
More terms from Michel Marcus, Mar 15 2015
STATUS
approved

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 April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)