A106836 First differences of A060833 and (from a(2) onward) also of A091067 and A255068.

3, 3, 1, 4, 1, 2, 1, 4, 3, 1, 1, 3, 1, 2, 1, 4, 3, 1, 4, 1, 2, 1, 1, 3, 3, 1, 1, 3, 1, 2, 1, 4, 3, 1, 4, 1, 2, 1, 4, 3, 1, 1, 3, 1, 2, 1, 1, 3, 3, 1, 4, 1, 2, 1, 1, 3, 3, 1, 1, 3, 1, 2, 1, 4, 3, 1, 4, 1, 2, 1, 4, 3, 1, 1, 3, 1, 2, 1, 4, 3, 1, 4, 1, 2, 1, 1, 3, 3, 1, 1, 3, 1, 2, 1, 1, 3, 3, 1, 4, 1, 2, 1

Offset: 1

Author

Ralf Stephan, May 03 2005

Keywords

• nonn

Comments

From Antti Karttunen, Feb 20 2015: (Start)

Among the terms a(1) .. a(8192), 1 occurs 4095 times, 2 occurs 1024 times, 3 occurs 2048 times and 4 occurs 1025 times. No larger numbers can ever occur.

That these are the first differences of not just A091067 and A255068, but also of A060833 follows from N. Sato's Feb 12 2013 comment in the latter that "For n > 1, n is in the sequence (A060833) if and only if A038189(n-1) = 1."

Also length of runs in A236840 and A255070.

(End)

Links

• Antti Karttunen, Table of n, a(n) for n = 1..8192

Crossrefs

Cf. A060833, A088742, A091067, A106837, A236840, A255058, A255068, A255070.

Programs

Scheme

(define (A106836 n) (if (= 1 n) 3 (- (A091067 n) (A091067 (- n 1)))))

Formula

a(1) = 3, and for n > 1: a(n) = A091067(n) - A091067(n-1). - Antti Karttunen, Feb 20 2015

Extensions

Name edited by Antti Karttunen, Feb 20 2015