37423

Properties

Appears in sequences

• Number of elements in Z[ omega ] whose 'smallest algorithm' is <= n, where omega^2 = -omega - 1.at n=8A006458
• Primes that remain prime through 3 iterations of function f(x) = 8x + 5.at n=30A023293
• Primes p such that p-1 and p+1 are both divisible by fourth powers.at n=23A086709
• Primes from merging of 5 successive digits in decimal expansion of e.at n=25A104846
• Number of nX3 arrays containing 3 indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing.at n=4A180841
• T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing.at n=25A180843
• a(n) = 111*n^2 - 3123*n + 10753.at n=35A211607
• Primes 8k + 7 at the end of the maximal gaps in A269519.at n=6A269521
• Sum T(n,k) of the entries in the k-th blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=29A285362
• Sum of the entries in the second blocks of all set partitions of [n].at n=6A285364
• Number of nX3 0..1 arrays with no 1 adjacent to 3 king-move neighboring 1s.at n=5A297089
• Number of nX6 0..1 arrays with no 1 adjacent to 3 king-move neighboring 1s.at n=2A297092
• T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 3 king-move neighboring 1s.at n=30A297094
• T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 3 king-move neighboring 1s.at n=33A297094
• a(n) = Sum_{k=1..n} (-1)^(n-k)*binomial(n,k)*sigma(k).at n=13A320568
• Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of regions in the resulting planar graph.at n=11A367118
• Numerator of the sum of the reciprocals of all square divisors of all positive integers <= n.at n=28A384817
• Prime numbersat n=3962