login
A256489
First differences of A257509: a(n) = A257509(n+1) - A257509(n).
3
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,1
COMMENTS
It seems that for all n >= 0, Sum_{k=1 .. 2^n} a(k) = 2^(n+3).
LINKS
FORMULA
a(n) = A257509(n+1) - A257509(n).
PROG
(Scheme) (define (A256489 n) (- (A257509 (+ n 1)) (A257509 n)))
(Haskell)
a256489 n = a256489_list !! (n-1)
a256489_list = zipWith (-) (tail a257509_list) a257509_list
-- Reinhard Zumkeller, May 06 2015
CROSSREFS
Sequence in context: A073447 A011213 A178728 * A129404 A222075 A117040
KEYWORD
nonn,hear
AUTHOR
Antti Karttunen, May 03 2015
STATUS
approved