114323

Appears in sequences

• a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.at n=32A067975
• Number of nX7 arrays of permutations of 7 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.at n=4A267741
• Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any west or northeast neighbors modulo 5 and the upper left element equal to 0.at n=6A267744
• Smallest possible value of |Sum_{k=0..n} (+-) 2^k * 3^(n-k)|, where each (+-) can be either plus or minus sign, independently for each term in the sum.at n=25A349544
• Positions of records in A030000.at n=36A372045