23156

Appears in sequences

• Numerators of continued fraction convergents to sqrt(233).at n=10A041434
• Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=21A054210
• Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2) + sopf(n-3), where sopf(x) = sum of the distinct prime factors of x.at n=0A075784
• Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.at n=22A094048
• Smallest integer x satisfying the Pell equation x^2-k*y^2=-1 for the values of k given in A031396.at n=42A130226
• Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=27A157116
• Number of permutations of length n which avoid the patterns 4231 and 3214.at n=9A165532
• Number of (w,x,y) with all terms in {0,...,n} and |w-x| != |x-y|.at n=28A212960
• Numbers n such that n^2 + 1, (n+1)^2 + 1 and (n+2)^2 + 1 are divisible by a square.at n=4A218048
• Value x in the solution of x^2-D*y^2=-1 as D runs through A003654.at n=39A249021
• Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers of A210843 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=38A249120
• Number of nX5 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nonincreasing.at n=16A266544
• Number of n X 4 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=5A268762
• Number of nX6 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=3A268764
• T(n,k)=Number of nXk binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=39A268766
• T(n,k)=Number of nXk binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=41A268766
• Numbers n such that sigma(n) is a Fibonacci number.at n=14A272412
• Bases b for which there exists an integer y such that y^3 in base b looks like [c,d,c,d] for some base-b digits c, d.at n=45A290176
• Numbers whose distance to the nearest cube equals the distance to the nearest product of 3 consecutive integers (three-dimensional oblong).at n=28A342873
• Numbers that are the sum of seven fourth powers in seven or more ways.at n=14A345573