37828

Appears in sequences

• a(n) = prime(n)*prime(n+1) - prime(n).at n=43A037166
• Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=33A039752
• Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=24A064675
• Number of (n+1)X(2+1) 0..2 arrays with every 2X2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally.at n=3A253401
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally.at n=1A253403
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally.at n=11A253407
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally.at n=13A253407
• Greatest integer k such that k/2^n < Euler's constant (0.577216...).at n=16A293352
• The integer k that minimizes |k/2^n - r|, where r = Euler's constant (0.577216...).at n=16A293354
• a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^3.at n=49A295575
• Expansion of Sum_{k>=1} (-1 + Product_{j>=1} (1 + j*x^(k*j))).at n=22A318290
• Expansion of e.g.f. (1 + x * (exp(x) - 1))^4.at n=7A377681