28701

Appears in sequences

• Numbers k such that k divides s(k), where s(1)=1, s(j)= s(j-1) + j*7^(j-1).at n=34A014948
• Expansion of 1/((1-2x)(1-3x)(1-4x)(1-10x)).at n=4A025927
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=25A109528
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=27A109528
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=22A109529
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=24A109529
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=26A109529
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=23A109530
• a(n)= 3*a(n-3) +3*a(n-6) +a(n-9).at n=28A109530
• a(n) = 2*(n-1) + Fibonacci(n).at n=22A129728
• Number of permutations of 1..n avoiding adjacent step pattern up, down, up, up.at n=8A177521
• Triangle read by rows: Pascal's triangle (A007318) times the Fibonacci triangle (A139375).at n=47A201165
• a(n) = 3*a(n-3) + 3*a(n-6) + a(n-9) for n>8, a(0)=0, a(1)=a(2)=1, a(3)=a(4)=2, a(5)=3, a(6)=7, a(7)=9, a(8)=11.at n=25A237988
• Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=15A252978
• G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..3*n} binomial(3*n,k)^2 * x^k] / A(x)^n * x^n/n ).at n=10A255839
• a(n) = Sum_{k=0..n} binomial(4*n+1,k) * binomial(4*n-k-1,n-k).at n=4A386834