32515

Appears in sequences

• Numbers n such that sum of first n consecutive prime numbers is pandigital (includes all 10 digits exactly once).at n=10A049442
• a(n) = sum_{k=1..n} prime(k)*prime(k+1).at n=19A074745
• Numbers n such that 2*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=13A102959
• Positive numbers y such that y^2 is of the form x^2+(x+119)^2 with integer x.at n=33A156650
• Number of increasing sequences of n integers x(1),...,x(n) with values in 1..4*n such that x(j) divides x(k) iff j divides k.at n=36A180381
• Number of nX2 0..3 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=7A202162
• T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=37A202168
• T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=43A202168
• Numbers k such that the sum of the first k consecutive prime numbers is pandigital (includes all 10 digits at least once).at n=10A228468
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+32478) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=36A274058