A111439 Variation of Golomb's sequence: a(n) is the number of times n appears with a(n) unequal to a(n-1).

1, 2, 3, 2, 3, 4, 3, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 16, 15, 16, 17, 16, 17, 16, 17

Offset: 1

Author

Floor van Lamoen, Nov 14 2005

Keywords

• nonn

Comments

a(n) is understood to be the smallest number >=a(n-2) fitting the description.

Links

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

Crossrefs

Bisections: A080606 and A080605. Cf. A001462 (Golomb's sequence).

Programs

PARI

r = vector(69,k,-1); p = 0; for (i=1, #r, v = 1; while (v==p || r[v]==0, v++); r[i]=v; r[v]--; print1 (v ", "); p=v); \\ Rémy Sigrist, Jan 28 2017

Extensions

Offset corrected by Rémy Sigrist, Jan 28 2017