14155776

Appears in sequences

• Composites of form prime-1 containing a record number of prime factors.at n=17A066632
• Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).at n=14A081411
• Number of divisors of n-th cyclic number.at n=19A087024
• a(1) = 1; a(n+1) = a(n) * k(n), where k(n) is the number of elements of {a(j)}, 1<=j<=n, which are <= n.at n=14A094590
• Numbers of divisors associated with the entries of A120585.at n=30A120586
• Third differences of A129952.at n=21A129955
• a(n) is the number of shapes of balanced trees with constant branching factor 4 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=27A131890
• List of pairs (a(n),b(n)): a(n) = prime(n) - prime(n-1) + a(n-1); b(n) = (prime(n) - prime(n-1))*b(n-1).at n=33A154279
• a(n) = 27*2^n.at n=19A175806
• Hankel transform of Thue-Morse related sequence A106400.at n=20A186026
• Hankel transform of A186032.at n=19A186033
• a(n) = (n/4)*2^(n/2)*((1+sqrt(2))^2 + (-1)^n*(1-sqrt(2))^2).at n=36A187272
• Number of n X 2 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=11A208428
• Numerator of A010786(n+1) / A010786(n).at n=46A208449
• Bitmasks that can be used to generate a sequence of all positive integers up to 2^n.at n=22A246866
• Power and multiply: distinct numbers a^b * c^d * e^f * g^h * i^j where a..j are permutations of 0..9.at n=15A266914
• Expansion of 1/Sum_{k>=0} A000326(k+1)*x^k.at n=22A296775
• a(n) = Product_{k=1..n-1} phi(gcd(n,k)).at n=35A349741
• Number of minimum total dominating sets in the 2 X n king graph.at n=38A350817