49100

Appears in sequences

• Indices of primes in sequence defined by A(0) = 93, A(n) = 10*A(n-1) + 53 for n > 0.at n=8A101017
• Indices of primes occurring in A030284.at n=37A107365
• Number of trailing zeros in sequence of factorials of Fibonacci numbers.at n=26A165753
• Number of n X 7 matrices containing a permutation of 1..n*7 in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=2A181194
• T(n,k) = number of n X k matrices containing a permutation of 1..n*k in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally.at n=38A181196
• Number of 3 X n matrices containing a permutation of 1..3*n in increasing order rowwise, columnwise and (downwards) antidiagonally.at n=6A181197
• a(n) = n! mod Fibonacci(n).at n=24A182213
• Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).at n=22A213044
• Number of permutations of 0..floor((3*n-2)/2) on odd squares of an 3Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=12A215871
• Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p_1,p_2,...,p_k) we have p_1<=p_2<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=39A227578
• Number of lattice paths from {n}^5 to {0}^5 using steps that decrement one component such that for each point (p_1,p_2,...,p_5) we have p_1<=p_2<=...<=p_5.at n=3A227596
• Expansion of f(-x, -x^5) * f(x, x^7) / f(-x, -x^2)^2 in powers of x where f(, ) is Ramanujan's general theta function.at n=26A262146
• Expansion of Product_{k>=2} (1 + x^Fibonacci(k))/(1 - x^Fibonacci(k)).at n=46A300414
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} d^(n/d + k).at n=60A308502
• Number of partitions of n whose greatest part is a multiple of 3.at n=48A363045
• The index of the record values in A369354.at n=10A369812