94710

Appears in sequences

• Fibonacci sequence beginning 0, 14.at n=20A022348
• a(n) is the smallest positive integer such that a(n)*(1^n + 2^n + ... + x^n) is a polynomial in x with integer coefficients.at n=40A064538
• Products of exactly 6 distinct primes.at n=17A067885
• Numbers with six distinct prime divisors.at n=22A074969
• a(n) = rad(A143176(n)).at n=40A144361
• Least number k such that all coefficients of k*B(n,x), the n-th Bernoulli polynomial, are integers.at n=40A144845
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=10A208551
• (Denominators of Cauchy numbers of the second kind hat c_{2n})/6.at n=19A222561
• Triangle read by rows: the triangle in A034855, with the n-th row normalized by dividing it by n.at n=24A235595
• Positions of records in A246272.at n=13A246349
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=15A285615
• Product of all distinct least part primes from all partitions of n into prime parts.at n=41A333129
• Numbers k > 2 such that omega(k) > log(log(k)) + 2 * sqrt(log(log(k))), where omega(k) is the number of distinct primes dividing k (A001221).at n=25A336910
• Lexicographically earliest sequence of positive distinct terms such that the digital root of a(n) is the number of distinct prime factors of a(n+1).at n=49A337096
• Trajectory of 397 under the map A340008: n -> n/2 if n is even, n-> n^2 - 1 if n is an odd prime, otherwise n -> n - 1.at n=15A340419
• a(n) is the smallest nonnegative integer such that the sum of any six ordered terms a(k), k<=n (repetitions allowed), is unique.at n=10A365302
• a(0) = 397; a(n+1) = a(n)^2 if a(n) is prime, floor(a(n)/2) otherwise.at n=13A376801
• Smallest k for which A384834(k) = n.at n=14A386557
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=15A387153