31011

Appears in sequences

• A nonlinear recurrence.at n=43A003073
• Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=41A039893
• Counting integers normally (1, 2, 3, 4, 5...), write them as roman numerals (I, II, III, IV, V...), describe them (one 1, two 1s, three 1s, one 1 one 5, one 5...), and write them out as numbers (11, 21, 31, 1115, 15...).at n=30A180105
• Number of nX3 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=4A277940
• Number of nX5 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=2A277942
• T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=23A277945
• T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=25A277945
• Numbers that are the sum of seven fourth powers in exactly seven ways.at n=33A345829
• Triangle T(n,k) read by rows, defined by the equation f(x, y) := Sum_{n, k} T(n, k) * y^k * x^n = 1/(1 - x*y - x^2*y*f(x, y+1)).at n=59A357438
• Antidiagonal sums of the array defined in A385623.at n=33A385624