25333

Appears in sequences

• Sum of fourth powers: 0^4 + 1^4 + ... + n^4.at n=10A000538
• a(n) = 1^n + 2^n + ... + 10^n.at n=4A001557
• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A024996.at n=9A026069
• a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A025177.at n=4A027259
• a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.at n=10A053820
• prime(2n) + prime(n) == 0 (mod n).at n=23A066896
• Consider the least number n such that n divided by pi(n) rounded is greater than any previous n; a(n) is the denominator of n/pi(n).at n=10A107614
• Sum of the first 10^n 4th powers.at n=1A130615
• Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=30A135384
• Smallest k > 0 such that (5^n+k)*5^n-1 and (5^n+k)*5^n+1 are a twin prime pair.at n=48A212487
• a(n) = Sum_{k = 1..n} k^phi(n), where phi(n) = A000010(n).at n=9A235137
• Number of partitions of n such that m(1) > m(3), where m = multiplicity.at n=40A240059
• Number of partitions of n such that the number of odd parts is not a part and the number of even parts is not a part.at n=43A240579
• Sum of the fourth powers of the parts in the partitions of n into two parts.at n=10A294271
• Sum of the fourth powers of the parts in the partitions of n into two distinct parts.at n=10A294288
• Expansion of 1/(1 - x*Product_{k>=1} (1 + k*x^k)).at n=12A299164