A256489 First differences of A257509: a(n) = A257509(n+1) - A257509(n).

8, 8, 3, 13, 3, 7, 11, 11, 3, 7, 11, 4, 12, 8, 3, 16, 3, 7, 11, 4, 12, 8, 3, 8, 13, 8, 3, 13, 3, 7, 9, 16, 3, 7, 11, 4, 12, 8, 3, 8, 13, 8, 3, 13, 3, 7, 9, 7, 14, 8, 3, 13, 3, 7, 9, 13, 3, 7, 9, 6, 10, 7, 5, 20, 3, 7, 11, 4, 12, 8, 3, 8, 13, 8, 3, 13, 3, 7, 9, 7, 14, 8, 3, 13, 3, 7, 9, 13, 3, 7, 9, 6, 10, 7, 5, 10, 15, 8, 3, 13, 3, 7, 9

Offset: 1

Author

Antti Karttunen, May 03 2015

Keywords

• nonn
• hear

Comments

It seems that for all n >= 0, Sum_{k=1 .. 2^n} a(k) = 2^(n+3).

Links

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

Crossrefs

Cf. A257509, A256490.

Programs

Haskell

a256489 n = a256489_list !! (n-1)
a256489_list = zipWith (-) (tail a257509_list) a257509_list
-- Reinhard Zumkeller, May 06 2015

Scheme

(define (A256489 n) (- (A257509 (+ n 1)) (A257509 n)))

Formula

a(n) = A257509(n+1) - A257509(n).