93311

Appears in sequences

• a(n) = 2*n^n-1.at n=6A062207
• (Product of twin primes - 1)/2.at n=22A120876
• a(n) = 72*n^2 - 1.at n=35A158738
• a(n) = 6^n/3 - 1.at n=6A164559
• Partial sums of A164532.at n=12A164560
• Numbers of the form i*6^j-1 (i=1..5, j >= 0).at n=31A181288
• a(n) = 54n^3 - 1.at n=11A181968
• Numbers which contain only the digit 5 in their base-6 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1, 2, 3, or 4, otherwise the exception must be the digit 4.at n=45A188532
• Increasing sequence S generated by these rules: a(1)=1, and if x is in S then both 3x+2 and 4x+3 are in S.at n=46A191145
• T(n,k)=Number of nXk 0..k arrays with every repeated value in every row and column equal to the previous repeated value, and new values introduced in row-major sequential order.at n=16A268003
• Number of 2Xn 0..n arrays with every repeated value in every row and column equal to the previous repeated value, and new values introduced in row-major sequential order.at n=4A268005
• T(n,k)=Number of nXk 0..k arrays with every repeated value in every row equal to, and in every column unequal to, the previous repeated value, and new values introduced in row-major sequential order.at n=16A268180
• Bases b for which there exists an integer y such that y^3 in base b looks like [c,d,e,c,d,e] for base-b digits c,d,e.at n=30A290185