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 A238596 #12 May 19 2014 02:39:43 %S A238596 2,6,50,1140,86052 %N A238596 Number of distinct sequences defined by the upper left value in powers of n X n (0,1) matrices. %C A238596 A sequence can be defined by powers of a matrix with only 0 and 1 values. For instance, the upper left value in the matrix M^n where M=[0 1; 1 1] is the Fibonacci sequence. %C A238596 Also, the number of distinct sequences defined by all element values in powers of n X n (0, 1) matrices (see A239748) that start with 1. - _Christopher Hunt Gribble_, May 12 2014 %e A238596 a(2) = 6 since there are 6 distinct sequences for 2 X 2 (0,1) matrices: %e A238596 [0 0; 0 0] => 0 0 0 0 0 ... %e A238596 [1 0; 0 0] => 1 1 1 1 1 ... %e A238596 [0 1; 0 0] => 0 0 0 0 0 ... %e A238596 [1 1; 0 0] => 1 1 1 1 1 ... %e A238596 [0 0; 1 0] => 0 0 0 0 0 ... %e A238596 [1 0; 1 0] => 1 1 1 1 1 ... %e A238596 [0 1; 1 0] => 0 1 0 1 0 ... %e A238596 [1 1; 1 0] => 1 2 3 5 8 ... %e A238596 [0 0; 0 1] => 0 0 0 0 0 ... %e A238596 [1 0; 0 1] => 1 1 1 1 1 ... %e A238596 [0 1; 0 1] => 0 0 0 0 0 ... %e A238596 [1 1; 0 1] => 1 1 1 1 1 ... %e A238596 [0 0; 1 1] => 0 0 0 0 0 ... %e A238596 [1 0; 1 1] => 1 1 1 1 1 ... %e A238596 [0 1; 1 1] => 0 1 1 2 3 ... %e A238596 [1 1; 1 1] => 1 2 4 8 16 ... %Y A238596 Cf. A239748. %K A238596 hard,more,nonn %O A238596 1,1 %A A238596 _Jay Anderson_, Mar 01 2014