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.
%I A239748 #22 Apr 25 2014 19:49:42 %S A239748 2,13,132,3833,363288 %N A239748 Number of distinct sequences defined by the elements of powers >= 0 of n X n (0,1) matrices. %H A239748 Christopher Hunt Gribble, <a href="/A239748/a239748.cpp.txt">C++ Program</a> %e A239748 a(2) = 13 because there are 13 distinct sequences in the set of 256 sequences formed by each element of each 2 X 2 binary matrix raised to successive powers >= 0. The first 10 terms of the distinct sequences and the frequencies of occurrence are: %e A239748 Sequence Frequency %e A239748 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... 16 %e A239748 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, ... 2 %e A239748 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ... 2 %e A239748 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... 4 %e A239748 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... 4 %e A239748 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ... 2 %e A239748 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, ... 2 %e A239748 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... 12 %e A239748 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ... 2 %e A239748 1, 0, 1, 1, 2, 3, 5, 8, 13, 21, ... 2 %e A239748 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... 12 %e A239748 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... 2 %e A239748 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, ... 2 %e A239748 . Total 64 %Y A239748 Cf. A238596. %K A239748 nonn,hard,more %O A239748 1,1 %A A239748 _Christopher Hunt Gribble_, Mar 26 2014