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.

A257059 Number of length n 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.

This page as a plain text file.
%I A257059 #7 Jun 02 2025 11:46:22
%S A257059 1,4,18,81,1024,7353,106056,1249592,22143847,282475249,8589934592,
%T A257059 133642251792,3531308221901,71789886480657,2171807721018968,
%U A257059 45949729863572161,2218611106740436992,53241469411989452625
%N A257059 Number of length n 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.
%C A257059 Diagonal of A257062
%H A257059 R. H. Hardin, <a href="/A257059/b257059.txt">Table of n, a(n) for n = 1..93</a>
%e A257059 Some solutions for n=4
%e A257059 ..3....4....2....2....3....3....4....4....4....2....2....3....4....2....3....4
%e A257059 ..5....5....2....1....1....3....2....5....4....2....1....1....5....4....5....4
%e A257059 ..2....5....2....5....2....3....2....3....1....5....5....4....5....2....4....4
%e A257059 ..4....1....4....1....4....1....4....2....3....3....4....1....2....1....2....2
%Y A257059 Cf. A257062
%K A257059 nonn
%O A257059 1,2
%A A257059 _R. H. Hardin_, Apr 15 2015