68112

Appears in sequences

• Smallest k such that k*i^2 + 1 is prime for i = 1 to n.at n=8A089761
• Start with 1 and repeatedly reverse the digits and add 37 to get the next term.at n=17A118633
• a(n) = n*(n+1)*(4*n+1)/2.at n=32A135713
• a(n) = 81*n^2 - 9.at n=28A157909
• Number of n X 5 binary arrays without the pattern 0 1 diagonally or antidiagonally.at n=32A188820
• a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n^3 + n^2 + n + 1.at n=40A227015
• Number of (n+1)X(2+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.at n=6A263218
• Number of (n+1)X(7+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.at n=1A263223
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.at n=29A263224
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.at n=34A263224
• Expansion of e.g.f. Sum_{k>=1} prime(k)*log(1 + x)^k/k!.at n=8A307772
• Primitive terms of A388022: numbers k that satisfy sigma(k) AND 3*k = 3*k, but none of whose proper divisors satisfy the same condition.at n=16A388025
• Numbers k for which sigma(k) >= 2*k and (sigma(k) - 2*k) AND k = k, where AND is bitwise-and, A004198.at n=38A388026