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.

A123641 Triangular array related to sequence A123640 with row sum A001045.

This page as a plain text file.
%I A123641 #7 Feb 09 2014 17:29:26
%S A123641 1,0,1,1,0,2,0,1,0,4,1,0,2,0,8,0,1,0,4,0,16,1,0,2,0,8,0,32,0,1,0,4,0,
%T A123641 16,0,64,1,0,2,0,8,0,32,0,128,0,1,0,4,0,16,0,64,0,256,1,0,2,0,8,0,32,
%U A123641 0,128,0,512,0,1,0,4,0,16,0,64,0,256,0,1024,1
%N A123641 Triangular array related to sequence A123640 with row sum A001045.
%e A123641 For n>0 A123640 begins
%e A123641 1
%e A123641 0 1
%e A123641 1 0 1 1
%e A123641 0 1 0 0 1 1 1 1
%e A123641 suppressing multiple zeros and counting contiguous ones yields
%e A123641 1
%e A123641 0 1
%e A123641 1 0 2
%e A123641 0 1 0 4
%e A123641 1 0 2 0 8
%e A123641 0 1 0 4 0 16
%e A123641 ...
%o A123641 (PARI) a001045(n)=(2^n-(-1)^n)/3;
%o A123641 lista(nn) = {last = v[2]; nb = 1; s = 0; j = 1; for (i=3, nn, if ((v[i] == last) && (s+v[i] < a001045(j)), nb++; s += v[i];, if (last, w = nb, w = 0); print1(w, ", "); nb = 1; last = v[i]; if (s + v[i] >= a001045(j), s = 0; j++;, s += v[i];);););} \\ _Michel Marcus_, Feb 09 2014
%Y A123641 Cf. A000079, A001045, A059841, A123640.
%K A123641 nonn,tabl
%O A123641 1,6
%A A123641 _Alford Arnold_, Oct 04 2006
%E A123641 More terms from _Michel Marcus_, Feb 09 2014