28523

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=25A024460
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=24A024468
• Positive integers such that the smallest positive real solution to x^n + x = 2*Pi*a(n) forms a monotonically increasing sequence as n grows.at n=13A080019
• Numerator of Sum_{k=0..n} 1/binomial(n,k)^2.at n=10A100516
• A three-dimensional version of the cellular automaton A160118, using cubes.at n=24A160119
• Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=42A240449
• Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=38A309562
• Expansion of (1/x) * Series_Reversion( x*(1+x-x^4)/(1+x)^3 ).at n=9A366099