32368

Appears in sequences

• Starting positions of strings of 3 0's in the decimal expansion of Pi.at n=28A050202
• a(n) = 28*n^2.at n=34A064763
• Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=16A096554
• Number of ways to place 2 nonattacking queens on an n X n toroidal board.at n=16A172517
• Numbers n such that n^2 is divisible by the sum of the distinct prime divisors of n^2 + 1.at n=20A196219
• Number of ways to place 2 nonattacking nightriders on an n X n toroidal board.at n=16A196812
• a(n) = spt(5n+4)/5 where spt(n) = A092269(n).at n=7A220505
• Erroneous version of A000079.at n=15A221180
• Number of iterations of A268395 needed to reach zero from 2^n: a(n) = A268708(2^n).at n=19A268709
• Number of iterations of A268395 needed to reach zero from 2^n + 1: a(n) = A268708(2^n + 1).at n=19A268710
• Practical numbers q with q + 2 and q^2 + 2 both practical.at n=18A294225
• a(n) = ((n + 1)^2 * (5*n + 4)*n) / 12.at n=16A368046
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 3.at n=11A380924