20976

Appears in sequences

• Number of partitions of n with equal number of parts congruent to each of 3 and 4 (mod 5).at n=46A035561
• McKay-Thompson series of class 22a for Monster.at n=26A058569
• Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).at n=25A063969
• a(1) = 1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) equals n^4.at n=2A070904
• Graham-Pollak sequence with initial term 5.at n=24A091522
• Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.at n=21A096558
• a(n) = 16*(8*prime(n) + 7).at n=37A098823
• Difference between n-th prime squared and n-th perfect square.at n=34A106588
• a(1)=1, a(n) = a(n-1) + n^5 if n odd, a(n) = a(n-1) + n^3 if n is even.at n=7A135099
• Partial sums of A160410.at n=27A160799
• a(n) is the sum of all possible pairs of the first n primes.at n=22A162867
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,1.at n=20A222329
• Number of nX2 arrays containing 2 copies of 0..n-1 with no element plus any horizontal, vertical, diagonal or antidiagonal neighbor equal to n-1.at n=5A266207
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical, diagonal or antidiagonal neighbor equal to n-1.at n=26A266208
• Numbers k at which A343740(k) reaches a record high.at n=11A343742