12034

Properties

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=31A031828
• Otto Haxel's guess for magic numbers of nuclear shells.at n=33A033547
• a(n) = n^3 + 6*n^2 + 6*n + 1.at n=21A090197
• Numbers n such that for some k and a_1,a_2,...,a_k the concatenation of the a_i is equal to n and their product is equal to pi(n).at n=39A097221
• Times in hours, minutes and seconds (to the nearest second) at which the hour and minute hands of an analog clock, if interchanged, continue to indicate some other albeit accurate times, over a complete 12-hour sweep for the slower hand. Leading zeros omitted.at n=16A121577
• Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring.at n=18A137741
• If 0 <= n <= 3 then a(n) = n(n+1)(n+2)/3, if n >= 4 then a(n) = n(n^2+5)/3.at n=33A162626
• Convolution square of A001157 (the sum of squared divisors).at n=10A175705
• Numbers whose digits are a permutation of (0,...,m) for some m.at n=30A199168
• Numbers whose digits are a permutation of [0,...,n] and which contain the product of any two adjacent digits as a substring.at n=16A203569
• Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=9A207141
• G.f. A(x) satisfies A(x) = 1 + x * A(x) / A(x^2).at n=43A218033
• Smallest number k such that P = k*prime(n+1)*(prime(n)-1)+1, Q = k*prime(n+1)*P+1, R = (prime(n)-1)*Q+1 and P, Q, and R are all prime numbers.at n=19A245016
• Number of distinct (n!)-tuples, with integer entries between 0 and n, inclusive, where entries measure the length of the longest prefix of each of the n! permutations of 123...n that is a subsequence of some string over the alphabet {1,2,3,...n}.at n=3A259553
• a(n) = smallest k such that the digits of exactly n nonnegative numbers are a subsequence of the digits of k.at n=27A275782
• Starting with a(1) = 0, a(2) = 1, a(n) = smallest nonnegative integer that shares all digits with previous terms. No repeated digits are allowed.at n=31A297062
• Starting with a(1) = 0, a(2) = 1, a(n) = smallest nonnegative integer not yet in the sequence that shares all digits with previous terms.at n=38A297065
• a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10.at n=17A302095
• Partial sums of A323183.at n=37A323187
• a(n) is the smallest k such that A363533(k) = n, or -1 if no such k exists.at n=30A363536