25190

Appears in sequences

• Exponential convolution of Fibonacci numbers with themselves.at n=10A014334
• a(n) = Sum_{k=0..floor(n/2)} A026626(n-k, k).at n=21A026636
• Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.at n=33A059834
• Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).at n=15A092198
• a(n) = 8 + floor((2 + Sum_{j=1..n-1} a(j))/4).at n=36A120166
• Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=14A129245
• G.f.: A(x) = exp( Sum_{n>=1} G_n(x^n)*x^n/n ) such that G_n(x^n) = Product_{k=0..n-1} A(u^k*x) where u is an n-th root of unity.at n=12A203254
• Number of n X 5 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=5A241252
• T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=50A241255
• Number of 6Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=4A241260
• a(n) is the number of edges formed by n-secting the angles of a decagon.at n=24A335802