OFFSET

1,3

COMMENTS

In other words, if we take the ordinal transform of the digits of the sequence and prepend the number 1, then we obtain the sequence again.

The number 1 appears 11 times.

Any number > 1 appears 10 times.

The sequence contains arbitrarily large runs of consecutive numbers.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Colored scatterplot of (n, a(n)) for n = 1..1000000 (where the color is function of the n-th digit of the sequence)

EXAMPLE

The first terms of the sequence, alongside the (n-1)-th digit of the sequence, are:

n a(n) (n-1)-th digit

--- ---- --------------

1 1 N/A

2 1 1

3 2 1

4 1 2

5 3 1

6 1 3

7 4 1

8 1 4

9 5 1

10 1 5

11 6 1

12 1 6

13 7 1

14 1 7

15 8 1

16 1 8

17 9 1

18 1 9

19 10 1

20 11 1

21 1 0

PROG

(PARI) a = [1]; ord = vector(base = 10); for (k=1, 59, a = concat(a, apply(d -> ord[1+d]++, digits(a[k], #ord)))); print (a)

CROSSREFS

KEYWORD

nonn,base

AUTHOR

Rémy Sigrist, Nov 30 2018

STATUS

approved