23069

Appears in sequences

• Smallest magic constant for any n X n magic square made from consecutive primes, or 0 if no such magic square exists.at n=18A073520
• a(n) = floor(Li(2^n)), where Li(x) is the integral from 0 to x of dt/log(t).at n=17A089897
• Numbers k such that sigma(k)-k = pi(sigma(k)).at n=4A090999
• Number of permutations of length n which avoid the patterns 1432, 2314, 3124.at n=9A116787
• A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes.at n=23A140763
• Sum of the numbers already removed (including the target number) in the first jump of a Sieve of Eratosthenes table.at n=32A179654
• Number of length n+3+2 0..3 arrays with every value 0..3 appearing at least once in every consecutive 3+3 elements, and new values 0..3 introduced in order.at n=6A242318
• T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order.at n=42A242322
• Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=34A260549
• Numbers in A007504 such that omega(a(n)) = Omega(a(n)) = 3.at n=18A264885
• Smallest magic sum for any n X n semimagic square made from consecutive primes, or 0 if no such magic square exists.at n=18A270829
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)^2, where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296254
• a(n) = n*((4*n + 1)*(7*n - 4) + 15*n*(-1)^n)/48.at n=33A302766
• a(n) = smallest potential magic constant for an n X n magic square composed of consecutive primes.at n=18A342124