131625

Appears in sequences

• Numbers k such that core(k) = b(k,1)*b(k,0) where b(k,1) is the number of 1's in binary representation of k, b(k,0) the number of 0's and core(k) the squarefree part of k.at n=13A071639
• A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=35A096772
• Number of reduced words of length n in the Weyl group A_10.at n=12A161458
• Totally multiplicative sequence with a(p) = 8p-1 for prime p.at n=39A166657
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=5A188439
• a(n) = n^3*(5*n+3)/2.at n=15A229146
• Triangle read by rows: T(n, k) = n*binomial(n, k)*A000757(k), 0 <= k <= n.at n=53A233440
• a(n) = Product_{k=0..n} (4*k+1)^(n-k).at n=4A263430
• Least odd primitive abundant number having its prime signature.at n=16A316116
• Primitive nondeficient numbers sorted by largest prime factor then by increasing size. Irregular triangle T(n, k), n >= 2, k >= 1, read by rows, row n listing those with largest prime factor = prime(n).at n=26A338133
• Numbers whose square can be represented in exactly three ways as the sum of a positive square and a positive fourth power.at n=14A345968
• Primitive abundant numbers for which there is no smaller primitive abundant number having the same ordered prime signature.at n=28A357921