165165

Appears in sequences

• a(n) is least k such that k and 9k are anagrams in base n (written in base 10).at n=30A023101
• a(n) = 5*(n+1)*binomial(n+4,6).at n=8A027802
• a(n) = 165*(n+1)*binomial(n+4,11)/4.at n=3A027807
• a(n) = 3*(n+1)*binomial(n+5,6).at n=9A027811
• Boundaries of primorial intervals [1,3]; [3,9],[9,15]; [15,45], etc.at n=22A065917
• Numbers with exactly 5 distinct odd prime divisors {3,5,7,11,13}.at n=5A147578
• Triangle of the elementwise product of binomial coefficients with q-binomial coefficients [n,k] for q = 3.at n=23A157640
• Triangle of the elementwise product of binomial coefficients with q-binomial coefficients [n,k] for q = 3.at n=25A157640
• Numbers k such that the sum of the distinct prime divisors of k equals three times the largest prime divisor of k.at n=13A200090
• Number of unlabeled, connected graphs on n vertices with at least one induced subgraph isomorphic to a K_4, where K_4 is the complete graph on four vertices.at n=8A243244
• G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3 * A(x)^3.at n=18A346733
• Odd abundant numbers that are also doublets (cf. A020338).at n=3A380232