118459

Appears in sequences

• Write n in base 10 as d1d2d3.....dk; for a list of primes P = (p1,p2,p3,....pk) with p1<p2<p3<.....<pk, let A(P,n)=(p1^d1)*(p2^d2)*(p3^d3)*.....(pk^dk) and B(P,n)= concatenation of primes and powers = p1&d1&p2&d2&p3&d3&.......&pk&dk. Then a(n) is the smallest number A(P,n) such that A(P,n)>B(p,n) if it exists, otherwise 0.at n=30A134328
• a(n) = n^3*Fibonacci(n).at n=11A259546
• The number of overpartitions of n where the number of non-overlined parts is at least two more than the number of overlined parts.at n=31A340668
• a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least two elements of S) > difference between greatest two elements of S.at n=17A357290