23330

Appears in sequences

• a(0) = 1, a(n) = 18*n^2 + 2 for n>0.at n=36A010008
• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=27A010021
• Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.at n=50A034393
• Length of hypotenuse squared in right triangle formed by a prime spiral plotted in Cartesian coordinates.at n=28A048851
• Hypotenuses of special Pythagorean triples constructed from twin primes as follows: {u, w}={p,p+2}; side a=2p(p+2), side b=(p+2)^2-p^2 and the terms of sequence are values of c=a(n)=p^2+(p+2)^2=phi(a/2)+1+sigma(a/2)+1.at n=9A063533
• a(n) = prime(n+1)^2 + prime(n)^2.at n=27A069484
• Least k such that 10^n + k - 1 is the first of a pair of twin primes.at n=42A103129
• Number of n X 7 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.at n=3A163719
• Number of n X 4 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent.at n=6A163725
• Array A(k,n) of the number of points of the A_k lattice with maximum infinity norm n, read by antidiagonals.at n=49A175197
• Sum of the third largest parts of the partitions of n into 9 parts.at n=41A326471
• Number of ways to write n as an ordered sum of 10 squarefree numbers.at n=9A341070
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to bottom row, and no 1 having more than two 1's adjacent.at n=48A391822