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.

A236109 Triangle read by rows: another version of A048158, only here the representation of A004125 is symmetric, as in the representation of A024916 and A000203.

This page as a plain text file.
%I A236109 #27 Mar 13 2015 23:51:54
%S A236109 0,0,0,0,0,1,0,0,0,1,0,0,0,2,2,0,0,0,0,1,2,0,0,0,0,2,3,3,0,0,0,0,0,2,
%T A236109 3,3,0,0,0,0,0,2,2,4,4,0,0,0,0,0,0,2,3,4,4,0,0,0,0,0,0,3,4,5,5,5,0,0,
%U A236109 0,0,0,0,0,2,2,3,5,5,0,0,0,0,0,0,0,3
%N A236109 Triangle read by rows: another version of A048158, only here the representation of A004125 is symmetric, as in the representation of A024916 and A000203.
%C A236109 Row sums give A004125.
%C A236109 For more information see A236104, A237591, A237593, A237270.
%e A236109 Triangle begins:
%e A236109 0;
%e A236109 0, 0;
%e A236109 0, 0, 1;
%e A236109 0, 0, 0, 1;
%e A236109 0, 0, 0, 2, 2;
%e A236109 0, 0, 0, 0, 1, 2;
%e A236109 0, 0, 0, 0, 2, 3, 3;
%e A236109 0, 0, 0, 0, 0, 2, 3, 3;
%e A236109 0, 0, 0, 0, 0, 2, 2, 4, 4;
%e A236109 0, 0, 0, 0, 0, 0, 2, 3, 4, 4;
%e A236109 0, 0, 0, 0, 0, 0, 3, 4, 5, 5, 5;
%e A236109 0, 0, 0, 0, 0, 0, 0, 2, 2, 3, 5, 5;
%e A236109 ...
%e A236109 For the symmetric representation of A000203, A024916, A004125 in the fourth quadrant using a diagram which arises from the sequence A236104 see below:
%e A236109 --------------------------------------------------
%e A236109 n     A000203  A024916            Diagram
%e A236109 --------------------------------------------------
%e A236109 .                         _ _ _ _ _ _ _ _ _ _ _ _
%e A236109 1        1        1      |_| | | | | | | | | | | |
%e A236109 2        3        4      |_ _|_| | | | | | | | | |
%e A236109 3        4        8      |_ _|  _|_| | | | | | | |
%e A236109 4        7       15      |_ _ _|    _|_| | | | | |
%e A236109 5        6       21      |_ _ _|  _|  _ _|_| | | |
%e A236109 6       12       33      |_ _ _ _|  _| |  _ _|_| |
%e A236109 7        8       41      |_ _ _ _| |_ _|_|    _ _|
%e A236109 8       15       56      |_ _ _ _ _|  _|     |* *
%e A236109 9       13       69      |_ _ _ _ _| |      _|* *
%e A236109 10      18       87      |_ _ _ _ _ _|  _ _|* * *
%e A236109 11      12       99      |_ _ _ _ _ _| |* * * * *
%e A236109 12      28      127      |_ _ _ _ _ _ _|* * * * *
%e A236109 .
%e A236109 The 12th row is ........ 0,0,0,0,0,0,0,2,2,3,5,5
%e A236109 .
%e A236109 The total number of cells in the first n set of symmetric regions of the diagram equals A024916(n). It appears that the total number of cells in the n-th set of symmetric regions of the diagram equals sigma(n) = A000203(n). Example: for n = 12 the 12th row of triangle is 144, 25, 9, 1, hence the alternating sums is 144 - 25 + 9 - 1 = 127. On the other hand we have that A000290(12) - A004125(12) = 144 - 17 = A024916(12) = 127, equaling the total number of cells in the diagram after 12 stages. The number of cells in the 12th set of symmetric regions of the diagram is sigma(12) = A000203(12) = 28. Note that in this case there is only one region. The number of "*"'s is A004125(12) = 17.
%Y A236109 Cf. A000203, A004125, A024916, A048158, A196020, A235799, A236104, A236630, A236631, A237591, A237593, A237270.
%K A236109 nonn,tabl
%O A236109 1,14
%A A236109 _Omar E. Pol_, Jan 26 2014