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.

A361227 Irregular triangle T(n, k), n > 0, k = 0..A007814(n), read by rows: T(n, k) = Sum_{i = n-2^k+1..n} A361144(i).

This page as a plain text file.
%I A361227 #9 Mar 13 2023 06:31:18
%S A361227 1,2,3,4,5,9,12,6,7,13,8,10,18,31,43,11,14,25,15,17,32,57,16,19,35,20,
%T A361227 21,41,76,133,176,22,23,45,24,26,50,95,27,28,55,29,30,59,114,209,33,
%U A361227 34,67,36,37,73,140,38,39,77,40,42,82,159,299,508,684,44,46,90
%N A361227 Irregular triangle T(n, k), n > 0, k = 0..A007814(n), read by rows: T(n, k) = Sum_{i = n-2^k+1..n} A361144(i).
%C A361227 This sequence gives the sums underlying A361144: the n-th row corresponds to the sums where A361144(n) is the last term.
%C A361227 Each integer appears once in this sequence.
%H A361227 Rémy Sigrist, <a href="/A361227/b361227.txt">Table of n, a(n) for n = 1..8191</a>
%H A361227 Rémy Sigrist, <a href="/A361227/a361227.txt">C++ program</a>
%H A361227 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A361227 T(n, 0) = A361144(n).
%e A361227 Triangle T(n, k) begins:
%e A361227   n   n-th row
%e A361227   --  ----------------
%e A361227    1   1
%e A361227    2   2,  3
%e A361227    3   4
%e A361227    4   5,  9, 12
%e A361227    5   6
%e A361227    6   7, 13
%e A361227    7   8
%e A361227    8  10, 18, 31, 43
%e A361227    9  11
%e A361227   10  14, 25
%e A361227   11  15
%e A361227   12  17, 32, 57
%o A361227 (C++) See Links section.
%Y A361227 Cf. A007814, A361144.
%K A361227 nonn,tabf
%O A361227 1,2
%A A361227 _Rémy Sigrist_, Mar 05 2023