cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A268836 Antidiagonal sums of array A268714: a(n) = Sum_{k=0..n} A006068(n)+A006068(n-k).

This page as a plain text file.
%I A268836 #11 Jun 25 2022 00:59:06
%S A268836 0,2,8,12,26,38,46,56,86,114,138,164,180,198,220,240,302,362,418,476,
%T A268836 524,574,628,680,712,746,784,820,866,910,950,992,1118,1242,1362,1484,
%U A268836 1596,1710,1828,1944,2040,2138,2240,2340,2450,2558,2662,2768,2832,2898,2968,3036,3114,3190,3262,3336,3430,3522,3610,3700
%N A268836 Antidiagonal sums of array A268714: a(n) = Sum_{k=0..n} A006068(n)+A006068(n-k).
%H A268836 Antti Karttunen, <a href="/A268836/b268836.txt">Table of n, a(n) for n = 0..4096</a>
%F A268836 a(n) = Sum_{k=0..n} A006068(n)+A006068(n-k).
%o A268836 (Scheme)
%o A268836 (define (A268836 n) (add (lambda (k) (+ (A006068 k) (A006068 (- (+ n 0) k)))) 0 n))
%o A268836 (define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
%Y A268836 Cf. A006068, A268714.
%Y A268836 Cf. also A268837, A268721.
%Y A268836 Partial sums of A268716.
%K A268836 nonn
%O A268836 0,2
%A A268836 _Antti Karttunen_, Feb 15 2016