110253

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=33A001210
• Number of (n+1)X3 0..3 matrices with each 2X2 permanent equal.at n=2A224969
• Number of (n+1)X4 0..3 matrices with each 2X2 permanent equal.at n=1A224970
• T(n,k) is the number of (n+1) X (k+1) 0..3 matrices with each 2 X 2 permanent equal.at n=7A224975
• T(n,k) is the number of (n+1) X (k+1) 0..3 matrices with each 2 X 2 permanent equal.at n=8A224975