25313

Appears in sequences

• Pseudoprimes to base 15.at n=31A020143
• Strong pseudoprimes to base 15.at n=6A020241
• Sums of the antidiagonals of the table of k-almost primes (A078840).at n=13A078842
• a(n) = ceiling((n+1)^4/2).at n=14A171714
• a(n) = ((2*n+1)^4+1)/2.at n=7A175110
• Triangle read by rows: T(n,k) is the number of ascent sequences of length n with maximal element k-1.at n=51A218577
• a(n) = 32*n^2 - 56*n + 25.at n=29A272129
• Number of partitions of n^4 into at most two parts.at n=15A274323
• Numbers k such that (25*10^k + 167) / 3 is prime.at n=24A276470
• Compound filter (summands of A004001 & summands of A005185): a(n) = P(A286541(n), A286559(n)), where P(n,k) is sequence A000027 used as a pairing function, with a(1) = a(2) = 0.at n=27A286560
• Compound filter (summands of A004001 & summands of A005185): a(n) = P(A286541(n), A286559(n)), where P(n,k) is sequence A000027 used as a pairing function, with a(1) = a(2) = 0.at n=28A286560
• Compound filter (summands of A004001 & summands of A005185): a(n) = P(A286541(n), A286559(n)), where P(n,k) is sequence A000027 used as a pairing function, with a(1) = a(2) = 0.at n=29A286560
• L.g.f.: log(1 + Sum_{k>=1} prime(k)*x^k) = Sum_{n>=1} a(n)*x^n/n.at n=26A303073
• Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=32A309562
• Expansion of Product_{1 <= i < j} (1 + x^(i*j)).at n=53A321286
• a(n) = A048673(n^2).at n=35A337336
• Denominator of (1+sigma(s)) / ((s+1)/2), where s is the square of n prime-shifted once (s = A003961(n)^2 = A003961(n^2)).at n=35A337339