19936

Appears in sequences

• Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=23A075605
• Numbers k such that 2^(k+1) - 1 is prime.at n=23A090748
• Exponents m such that 1-A065395(2^m) is a power of 2, where A065395(n) = sigma(phi(n)) - phi(sigma(n)).at n=28A092591
• Number of partitions with maximum rectangle n.at n=19A115724
• Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5*T(n-1,k) + T(n-1,k+1) for k >= 1.at n=31A126331
• Number of binary strings of length n with equal numbers of 00101 and 10100 substrings.at n=15A164248
• a(n) = Sum_{d|n} A007955(d) * A000027(d) = Sum_{d|n} A007955(d) * (d), where A007955(m) = product of divisors of m.at n=26A174933
• Number of permutations of 1..n with the sum of squared adjacent differences < (n-1)*n*(n+1)/6.at n=6A180073
• Numbers k such that there are 14 primes between 100*k and 100*k + 99.at n=38A186406
• Triangle read by rows, T(n,k) n>=0, k>=0, generalization of A000255.at n=41A216154
• Triangular array counting derangements by number of descents.at n=42A219836
• Number of n X 2 arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out straight through or left turns.at n=4A221894
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out straight through or left turns.at n=19A221898
• Expansion of (f(-x^2) / phi(-x^3))^2 in powers of x where phi(), f() are Ramanujan theta functions.at n=36A233034
• Number of (0, 1)-necklaces with n zeros and n ones without zigzags (see reference for precise definition).at n=16A263658
• Numbers k such that k^4096 + (k+1)^4096 is prime.at n=9A274236
• a(n) is the number of regions formed by n-secting the angles of an octagon.at n=41A335769