4478976
domain: N
Appears in sequences
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*12^j.at n=26A038230
- Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*2^j.at n=37A038256
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*3^j.at n=22A038329
- For an integer k with prime factorization p_1*p_2*p_3* ... *p_m let k* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1) (A064478); sequence gives k such that k* is divisible by k.at n=34A064476
- Numbers n such that (phi(n) + sigma(n))/(rad(n))^2 is an integer > 1 (phi=A000010, sigma=A000203, rad=A007947).at n=22A097982
- Trajectory of 26888999 under "x -> product of digits of x" map.at n=1A121109
- Trajectory of 3778888999 under "x -> product of digits of x" map.at n=2A121110
- Trajectory of 277777788888899 under "x -> product of digits of x" map.at n=3A121111
- Numbers k such that (phi(k) + sigma(k))/rad(k)^2 is an integer, that is (phi(k) + sigma(k)) is divisible by every prime factor of k squared.at n=24A121850
- Cumulative product of A000120.at n=22A121853
- a(n) is the product of first n terms of sequence A127644.at n=6A127646
- a(n) = 2^L(n+1)*3^L(n), where L(n) is the n-th Lucas number (A000032(n)).at n=4A166471
- a(n) = 2^F(n+2)*3^F(n+1)/12, where F(n) is the n-th Fibonacci number (A000045(n)).at n=4A166472
- a(n) = floor(sqrt(n)) * a(n-1), starting with 1.at n=17A195458
- Numbers m such that phi(m) and tau(m) divide m, where phi = A000010 and tau = A000005.at n=41A235353
- a(0) = 3; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=0..n} a(i) divides a(n+1) + Sum_{i=0..n} a(i).at n=41A250306
- Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.at n=22A264791
- a(n) = product of first k composites, with the i-th composite raised to the d-th power, where k = A055642(n) and d is the i-th digit of n.at n=26A270142
- Numbers n such that first digit of n divides n, last digit of n divides n, number of divisors of n divides n and phi(n) divides n, where phi(n) is the Euler totient function.at n=30A277804
- Numbers k such that k^2 is sum of two positive 7th powers.at n=5A291828