A277315 a(n) = the largest coefficient in Stern polynomial B(n,t).

0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 2, 1, 1, 1, 2, 2, 3, 2, 4, 3, 3, 1, 3, 2, 3, 1, 2, 1, 1, 1, 2, 2, 3, 2, 5, 3, 4, 2, 4, 4, 6, 3, 5, 3, 3, 1, 3, 3, 5, 2, 5, 3, 4, 1, 3, 2, 3, 1, 2, 1, 1, 1, 2, 2, 3, 2, 5, 3, 4, 2, 6, 5, 8, 3, 7, 4, 4, 2, 4, 4, 8, 4, 10, 6, 7, 3, 6, 5, 8, 3, 5, 3, 3, 1, 3, 3, 5, 3, 7, 5, 6, 2, 6, 5, 8, 3, 7, 4, 4, 1, 4, 3, 5, 2, 5, 3, 4, 1

Offset

0,6

Comments

a(n) = gives the largest term on row n of table A125184.

Links

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

Formula

a(n) = A051903(A260443(n)).

a(2n) = a(n).

Prog

(Scheme)
(define (A277315 n) (A051903 (A260443 n)))
;; Or as a standalone program:
(define (A277315 n) (reduce max 0 (A260443as_coeff_list n)))
(definec (A260443as_coeff_list n) (cond ((zero? n) (list)) ((= 1 n) (list 1)) ((even? n) (cons 0 (A260443as_coeff_list (/ n 2)))) (else (add_two_lists (A260443as_coeff_list (/ (- n 1) 2)) (A260443as_coeff_list (/ (+ n 1) 2))))))
(define (add_two_lists nums1 nums2) (let ((len1 (length nums1)) (len2 (length nums2))) (cond ((< len1 len2) (add_two_lists nums2 nums1)) (else (map + nums1 (append nums2 (make-list (- len1 len2) 0)))))))

Crossrefs

Cf. A051903, A125184, A260443.

Sequence in context: A198339 A262561 A264990 * A277326 A050431 A051574

Adjacent sequences: A277312 A277313 A277314 * A277316 A277317 A277318

Keyword

nonn

Author

Antti Karttunen, Oct 10 2016

Status

approved