28965

Appears in sequences

• a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=43A023862
• a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=42A023870
• Size |S| of the largest subset S of {0,1}^n whose measure m(S) is <= 2^n, where m is the additive measure defined on each element x of S by m({x}) = 2^k(x), where k(x) is the number of non-null coordinates of x.at n=20A115993
• Values of m such that A139361(n)=4m+1.at n=38A139362
• a(n) = floor( prime(n)^3 / (n*log(n)) ).at n=35A259648
• Numbers n such that 3*n and n^3 have the same digit sum.at n=42A260906
• Numbers n such that sigma(n) is a Fibonacci number.at n=22A272412
• Indices of A002110(n) in A055932.at n=11A331938
• a(n) = Sum_{i+j+k=n, i,j,k >= 1} sigma(i) * sigma(j) * sigma(k).at n=15A374951
• Numbers k such that tau(k) and sigma(k) are both Fibonacci numbers.at n=9A390231