39936

Appears in sequences

• a(n) is least k such that k and 6k are anagrams in base n (written in base 10).at n=26A023098
• Triangular array read by rows: a(n,k) = Sum_{d|k} mu(d)*U(n,k/d) if k|n else 0, where U(n,k) = A047916(n,k) (1<=k<=n).at n=35A047918
• 12-almost primes (generalization of semiprimes).at n=21A069273
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=47A070980
• Record-setting differences between adjacent elements of the Mian-Chowla sequence variant A058335.at n=47A080931
• Binomial transform of A001651.at n=12A084858
• a(n) = (2*n+1)*2^floor((n+1)/2).at n=19A097578
• Difference between the factorial of n and the double factorial of n.at n=8A110903
• McKay-Thompson series of class 12A for the Monster group.at n=15A112147
• a(n)= n * reversal(n-1) * reversal(n+1).at n=23A160936
• Numbers with 44 divisors.at n=5A175751
• McKay-Thompson series of class 12A for the Monster group with a(0) = 6.at n=15A186829
• Number of 3:4:5 proportioned triangles on a (n+1)X(n+1) grid.at n=26A189972
• Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 9.at n=29A195093
• The arithmetic mean of the prime factors (with multiplicity) of n is 3.at n=38A200612
• (2n)! - 2^n*n!.at n=4A204841
• Number of (n+1) X 8 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=13A205192
• Binomial transform of the sum of the first n even squares (A002492).at n=8A240434
• Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.at n=5A268965
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.at n=26A268971