18692

Appears in sequences

• Number of partitions of n into an even number of parts.at n=40A027187
• Numbers having four 4's in base 8.at n=12A043440
• Number of cycle types of conjugacy classes of all even permutations of n elements.at n=40A046682
• Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having k UDUD's (here U=(1,1), D=(1,-1)).at n=57A094507
• Indices of primes in the sequence defined by A(0) = 51, A(n) = 10*A(n-1) + 71 for n > 0.at n=11A101587
• Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=16A124658
• Number of -2..2 arrays x(0..n+1) of n+2 elements with zero sum and nonzero first and second differences.at n=6A200448
• T(n,k)=Number of -k..k arrays x(0..n+1) of n+2 elements with zero sum and nonzero first and second differences.at n=34A200454
• Number of -n..n arrays x(0..8) of 9 elements with zero sum and nonzero first and second differences.at n=1A200461
• Number of (n+3) X 7 0..1 matrices with each 4 X 4 subblock idempotent.at n=15A224564
• Number of partitions of 2n of type EE (see Comments).at n=20A236913
• Number of Dyck paths of semilength n having exactly one occurrence of the consecutive pattern UDUD.at n=11A244236
• Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^(p-1) == 1 (mod p^2) and q = prime(n+1) satisfies b^(q-1) == 1 (mod q^2).at n=21A259075
• Length of row n of the array in A274183.at n=24A274184
• Number of 3D walks of type ace.at n=7A302186
• Number of integer partitions of n with reverse-alternating product <= 1.at n=40A347443
• High water marks for number of primes between prime(n)^2 and prime(n+1)^2.at n=37A380135
• a(n) is the least number k such that A380802(k) = n, or -1 if no such number exists.at n=18A380803