24852
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 8.at n=18A022313
- Numbers k such that 235*2^k+1 is prime.at n=30A032494
- Numbers n such that n | sigma_12(n).at n=27A055716
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=23A061662
- Smallest a(n) > a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, with a(1)=5.at n=28A076671
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=9.at n=28A076674
- Indices of primes in sequence defined by A(0) = 59, A(n) = 10*A(n-1) - 81 for n > 0.at n=13A101569
- Number of right triangles on a (n+1)X9 grid.at n=12A189813
- a(n) = Sum_{i=0..n} digsum_5(i)^4, where digsum_5(i) = A053824(i).at n=39A231671
- Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=0A252639
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=21A252640
- Number of (1+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=6A252641
- Number of regions in a "cross" of width 3 and height n (see Comments for definition).at n=17A331455
- Numbers k such that sigma(k) = psi(k) + phi(k) + omega(k)^5.at n=2A391908