23522

Appears in sequences

• Numbers k such that 45*2^k - 1 is prime.at n=52A002242
• Number of points on surface of dodecahedron: a(n) = 30*n^2 + 2 for n > 0.at n=28A005903
• Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=22A063061
• Quotient cycle length in continued fraction expansion of sqrt(1+n^n).at n=12A077097
• (1/12) * Number of non-degenerate scalene triangles that can be formed from the points of an (n+1) X (n+1) X (n+1) lattice cube.at n=3A103427
• Numbers k such that k and k^2 use only the digits 2, 3, 4, 5 and 8.at n=14A137069
• Number of nondecreasing arrangements of n numbers in -(n+1)..(n+1) with sum zero and not more than two numbers equal.at n=7A188230
• T(n,k)=Number of nondecreasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero and not more than two numbers equal.at n=52A188236
• Number of nondecreasing arrangements of 8 numbers in -(n+6)..(n+6) with sum zero and not more than two numbers equal.at n=2A188241
• Triangle read by rows: T(n,k) is the number of ascent sequences of length n with last zero at position k-1.at n=52A218579
• Number of partitions of n containing m(4) as a part, where m denotes multiplicity.at n=43A240489
• Numbers n such that A242719(n) = (prime(n))^2+1 and A242720(n) - A242719(n) = 2*(prime(n)+1).at n=26A246748
• Number of length-n 0..2 arrays with no following elements larger than the first repeated value.at n=9A267465
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.at n=59A268115
• Number of nX(n+2) arrays of permutations of n+2 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.at n=4A268118
• Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north or west neighbors modulo 5 and the upper left element equal to 0.at n=6A268121
• Number of nX4 0..1 arrays with every element equal to 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A300171
• Number of nX6 0..1 arrays with every element equal to 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A300173
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A300175
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=41A300175