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.

A351704 Sums of the ascending diagonals of the triangle A162609.

This page as a plain text file.
%I A351704 #53 May 14 2022 04:55:51
%S A351704 1,1,2,3,7,10,20,26,45,55,86,101,147,168,232,260,345,381,490,535,671,
%T A351704 726,892,958,1157,1235,1470,1561,1835,1940,2256,2376,2737,2873,3282,
%U A351704 3435,3895,4066,4580,4770,5341,5551,6182,6413,7107,7360,8120,8396,9225,9525,10426,10751,11727,12078,13132,13510,14645
%N A351704 Sums of the ascending diagonals of the triangle A162609.
%C A351704 Each term is the sum of an ascending diagonal of the triangle A162609.
%H A351704 Eddie Gutierrez, <a href="http://www.oddwheel.com/octawheel8b.html">The Wheel Octagon Triangle - Ascending Diagonals (Part VIIIb)</a>
%F A351704 a(n) = (n^3 + 2*n + 12)/12, for even n.
%F A351704 a(n) = (2*n^3 - 3*n^2 + 10*n + 15)/24, for odd n.
%e A351704 a(4) = (64 + 8 + 12)/12 = 7
%e A351704 a(5) = (250 - 75 + 50 + 15)/24 = 10.
%o A351704 (C) // Calculates and prints out the triangle and terms of ascending diagonals (on first line). To get more terms increment j.
%o A351704 #include <stdio.h>
%o A351704 int main()
%o A351704 {
%o A351704    int n, j=8, k, C, F1, F2,s;
%o A351704    F1=1; F2=1;
%o A351704    printf("%d ", F1);
%o A351704    printf("%d ", F2);
%o A351704    for (s=0;s<=j;s++)
%o A351704    {
%o A351704       F1=F1 + 2*s*s + 2*s + 1;
%o A351704       F2=F2 + 2*s*s + 3*s + 2;
%o A351704       printf("%d ", F1);
%o A351704       printf("%d ", F2);
%o A351704    }
%o A351704    printf("\n");
%o A351704    return 0;
%o A351704 }
%Y A351704 Cf. A162609.
%K A351704 nonn
%O A351704 0,3
%A A351704 _Eddie Gutierrez_, May 05 2022