28858
domain: N
Appears in sequences
- a(n) = Sum(Sum p_i, {Sum p_i=prime(n)}, p_i is prime).at n=14A120484
- Values of x in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z.at n=39A138667
- a(0)=a(1)=a(2)=0; thereafter a(n) = n*a(n-1) + n*a(n-2)/(n-2) + (-1)^(n-1)*4/(n-2).at n=8A186638
- Expansion of Sum_{k>=1} prime(k)*x^prime(k)/(1 - x^prime(k)) * Product_{k>=1} 1/(1 - x^prime(k)).at n=46A276560
- Number of integer partitions of n whose LCM is greater than n.at n=40A327779
- a(0) = 0, a(1) = 1. For n >= 2, a(n) = a(n-1)/(n-1) if n-1 divides a(n-1); otherwise, a(n) = a(n-1) + a(n-2).at n=30A343376
- Number of integer partitions of n whose odd parts are relatively prime.at n=39A366850