47355

Appears in sequences

• Coordination sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).at n=10A001354
• Fibonacci sequence beginning 0, 7.at n=20A022090
• Odd numbers with exactly 5 distinct prime factors.at n=17A046391
• Numbers n such that the middle coefficient of the cyclotomic polynomial Phi_n(x) has a value not obtained for any smaller n.at n=23A095877
• Third row of array in A101385.at n=10A101645
• Matrix cube of triangle A104980.at n=50A104990
• Divide each Fibonacci number by its primitive part.at n=39A105602
• a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=39A111079
• Odd squarefree abundant numbers.at n=15A112643
• Odd unitary abundant numbers.at n=15A129485
• Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=9A136476
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=28A146960
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=3A178782
• Primitive, odd, squarefree abundant numbers.at n=15A249263
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=34A298973
• a(n) = denominator(n!*[z^n]((cosh(x*z) + cos(x*z))*z/(1 - exp(-z)))(1)).at n=40A318142
• Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=26A322670
• a(n) = denominator(2^n*Sum_{k=0..n} binomial(n, k)*Bernoulli(k, 1/2)*x^(n-k)).at n=40A336454
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=15A339938
• Trajectory of 397 under the map A340008: n -> n/2 if n is even, n-> n^2 - 1 if n is an odd prime, otherwise n -> n - 1.at n=16A340419