30309

Appears in sequences

• Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=42A099964
• Number of n-bead necklaces labeled with numbers -3..3 not allowing reversal, with sum zero and first and second differences in -3..3.at n=10A209002
• Number of paths in B(n) that start with a u step and end with a d step.at n=16A247471
• Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=2A257420
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=8A257426
• Number of (3+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A257428
• Coefficients in the expansion of ([s] + [2s]x + [3s]x^2 + ...)/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = e/2, s = r/(1-r).at n=30A279633
• Numbers k such that 3*10^k + 97 is prime.at n=21A295401
• Number of nX2 0..1 arrays with every element unequal to 0, 1, 3 or 5 king-move adjacent elements, with upper left element zero.at n=12A303963
• a(n) = Sum_{k=0..floor(n/8)} binomial(n-4*k,4*k).at n=25A348289