32561

Properties

Appears in sequences

• MacMahon's solid partitions of n in which 2 is the smallest summand.at n=13A002043
• Powers of cube root of 11 rounded down.at n=13A018006
• Powers of cube root of 11 rounded to nearest integer.at n=13A018007
• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2,6,4]; short d-string notation of pattern = [264].at n=32A078848
• Primes p such that the differences between the 5 consecutive primes starting with p are (2,6,4,6).at n=7A078949
• Primes p such that p-1 and p+1 are both divisible by fourth powers.at n=20A086709
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 3X3 plus 2,1 2,2 2,3 1,2 3,2.at n=13A145998
• Numbers k such that k-1 and k+1 are each the product of exactly 7 primes, counted with multiplicity.at n=9A157487
• Primes dividing some member of A073833.at n=41A161500
• a(1) = 3. For n > 1, Ulam's spiral is started with a(n-1), and the primes p on the NE spoke are considered. a(n) is the minimal p that is the lesser of a twin prime pair.at n=37A163586
• Primes p such that p+2, p+8, and p+12 are all prime.at n=40A233540
• Primes p such that p^4 + p + 1 and p^4 - p - 1 are also prime.at n=22A236073
• Number of 2 X 2 matrices with all elements in {-n,..,0,..,n} with determinant = 2*permanent.at n=30A280343
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=14A289583
• T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=46A293087
• Number of 2 X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=8A293088
• a(n) equals the smallest Sophie Germain prime q such that pi_(p,2p+1)(q,10,(1,3)) - pi_(p,2p+1)(q,10,(3,1)) = n, where pi_(p,2p+1)(q,10,(b,c)) equals the number of Sophie Germain primes A005384(i) such A005384(i) <= q and (A005384(i),A005384(i+1)) == (b,c) (mod 10).at n=8A333084
• Primes p such that 2*p+1 and (2*p)^2+(2*p+1)^2 are also prime.at n=35A347110
• Sophie Germain primes p whose corresponding safe prime is an anagram of p.at n=2A371623
• Prime numbersat n=3493