23641
domain: N
Appears in sequences
- a(n) = 15*n^2 - 9*n + 1.at n=40A134154
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, -1, 0), (1, 0, -1), (1, 1, 1)}.at n=8A149764
- Numbers n such that 3^7*2^n - 1 is prime.at n=32A230537
- Number of (1+1)X(n+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..1+1} nondecreasing.at n=8A233375
- Number of partitions of n such that the least part is less than its multiplicity.at n=39A240175