134064

Appears in sequences

• a(1) = 1. a(n) = a(n-1) + a(m), where m is the largest term of the sequence {a(k)} which is less than n.at n=42A133488
• Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^5 = I.at n=6A163347
• Numbers with prime factorization pq^2r^2s^4.at n=21A190319
• Coordination sequence for (2,4,6) tiling of hyperbolic plane.at n=34A265061
• Numbers of the form A000217(n)*A007494(n) that are divisible by 3.at n=46A295867
• a(n) is the least number k such that A018804(k)/k = n.at n=36A353264
• Exponential abundant numbers that are not exponential unitary abundant.at n=19A391085
• Exponential Zumkeller numbers that are not exponential unitary Zumkeller numbers.at n=22A391090