Sequences
392,541 sequences
- a(n) = Sum_{d|n} phi(d)*4^(n/d).A054611
a(n) = Sum_{d|n} phi(d)*4^(n/d).
- a(n) = Sum_{d|n} phi(d)*5^(n/d).A054612
a(n) = Sum_{d|n} phi(d)*5^(n/d).
- a(n) = Sum_{d|n} phi(d)*6^(n/d).A054613
a(n) = Sum_{d|n} phi(d)*6^(n/d).
- a(n) = Sum_{d|n} phi(d)*7^(n/d).A054614
a(n) = Sum_{d|n} phi(d)*7^(n/d).
- a(n) = Sum_{d|n} phi(d)*8^(n/d).A054615
a(n) = Sum_{d|n} phi(d)*8^(n/d).
- a(n) = Sum_{d|n} phi(d)*9^(n/d).A054616
a(n) = Sum_{d|n} phi(d)*9^(n/d).
- a(n) = Sum_{d|n} phi(d)*10^(n/d).A054617
a(n) = Sum_{d|n} phi(d)*10^(n/d).
- Triangle T(n,k) = Sum_{d|n} phi(d)*k^(n/d).A054618
Triangle T(n,k) = Sum_{d|n} phi(d)*k^(n/d).
- Triangle T(n,k) = Sum_{d|k} phi(d)*n^(k/d).A054619
Triangle T(n,k) = Sum_{d|k} phi(d)*n^(k/d).
- Number of ways to color vertices of a pentagon using <= n colors, allowing only rotations.A054620
Number of ways to color vertices of a pentagon using <= n colors, allowing only rotations.
- Number of ways to color vertices of a heptagon using <= n colors, allowing only rotations.A054621
Number of ways to color vertices of a heptagon using <= n colors, allowing only rotations.
- Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.A054622
Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.
- Number of ways to color vertices of a 9-gon using <= n colors, allowing only rotations.A054623
Number of ways to color vertices of a 9-gon using <= n colors, allowing only rotations.
- Number of ways to color vertices of a 10-gon using <= n colors, allowing only rotations.A054624
Number of ways to color vertices of a 10-gon using <= n colors, allowing only rotations.
- Number of n-bead necklaces with 6 colors.A054625
Number of n-bead necklaces with 6 colors.
- Number of n-bead necklaces with 7 colors.A054626
Number of n-bead necklaces with 7 colors.
- Number of n-bead necklaces with 8 colors.A054627
Number of n-bead necklaces with 8 colors.
- Number of n-bead necklaces with 9 colors.A054628
Number of n-bead necklaces with 9 colors.
- Number of n-bead necklaces with 10 colors.A054629
Number of n-bead necklaces with 10 colors.
- T(n,k) = Sum_{d|k} phi(d)*n^(k/d)/k, triangle read by rows, T(n,k) for n >= 1 and 1 <= k <= n.A054630
T(n,k) = Sum_{d|k} phi(d)*n^(k/d)/k, triangle read by rows, T(n,k) for n >= 1 and 1 <= k <= n.
- Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.A054631
Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.
- Partial sums of A007376.A054632
Partial sums of A007376.
- Partial sums of A030190.A054633
Partial sums of A030190.
- Champernowne sequence: write n in base 8 and juxtapose.A054634
Champernowne sequence: write n in base 8 and juxtapose.
- Champernowne sequence: write n in base 3 and juxtapose.A054635
Champernowne sequence: write n in base 3 and juxtapose.
- Partial sums of A054634.A054636
Partial sums of A054634.
- Partial sums of A054635.A054637
Partial sums of A054635.
- 0 if pronounced name of n-th letter of English alphabet begin with a vowel sound, otherwise 1. Different from A074322.A054638
0 if pronounced name of n-th letter of English alphabet begin with a vowel sound, otherwise 1. Different from A074322.
- Queneau numbers: numbers n such that the Queneau-Daniel permutation {1, 2, 3, ..., n} -> {n, 1, n-1, 2, n-2, 3, ...} is of order n.A054639
Queneau numbers: numbers n such that the Queneau-Daniel permutation {1, 2, 3, ..., n} -> {n, 1, n-1, 2, n-2, 3, ...} is of order n.
- a(n) is the sum of the divisors of the n-th primorial: a(n) = A000203(A002110(n)).A054640
a(n) is the sum of the divisors of the n-th primorial: a(n) = A000203(A002110(n)).
- GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).A054641
GCD of divisor-sum of primorials and primorials itself: a(n) = gcd(A002110(n), A000203(A002110(n))).
- Distinct values of GCD of divisor sum of primorials and primorial itself: gcd(A002110(n), A000203(A002110(n))).A054642
Distinct values of GCD of divisor sum of primorials and primorial itself: gcd(A002110(n), A000203(A002110(n))).
- Primes prime(n) such that prime(n) + prime(n+1) + prime(n+2) == 0 (mod 3).A054643
Primes prime(n) such that prime(n) + prime(n+1) + prime(n+2) == 0 (mod 3).
- Number of labeled pure 2-complexes on n nodes with 3 2-simplexes.A054644
Number of labeled pure 2-complexes on n nodes with 3 2-simplexes.
- Triangle T(n,k) of asymmetric n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.A054645
Triangle T(n,k) of asymmetric n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.
- Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.A054646
Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 12 1-simplexes.A054647
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 12 1-simplexes.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 11 1-simplexes.A054648
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 11 1-simplexes.
- Triangle T(n, k) giving coefficients in expansion of n! * Sum_{i=0..n} binomial(x - n, i) in powers of x.A054649
Triangle T(n, k) giving coefficients in expansion of n! * Sum_{i=0..n} binomial(x - n, i) in powers of x.
- Nearest integer to 2^(n-1)/n.A054650
Nearest integer to 2^(n-1)/n.
- Triangle T(n,k) read by rows giving coefficients in expansion of n! * Sum_{i=0..n} C(x,i) in descending powers of x.A054651
Triangle T(n,k) read by rows giving coefficients in expansion of n! * Sum_{i=0..n} C(x,i) in descending powers of x.
- Number of acyclic orientations of the Hamming graph (K_2) x (K_n).A054652
Number of acyclic orientations of the Hamming graph (K_2) x (K_n).
- Number of acyclic orientations of the Hamming graph (K_3) x (K_n).A054653
Number of acyclic orientations of the Hamming graph (K_3) x (K_n).
- Triangle of Stirling numbers of 1st kind, S(n, n-k), n >= 0, 0 <= k <= n.A054654
Triangle of Stirling numbers of 1st kind, S(n, n-k), n >= 0, 0 <= k <= n.
- Triangle T(n,k) giving coefficients in expansion of n!*binomial(x-n,n) in powers of x.A054655
Triangle T(n,k) giving coefficients in expansion of n!*binomial(x-n,n) in powers of x.
- Number of primes <= n which do not appear in any partitions of n into distinct primes.A054656
Number of primes <= n which do not appear in any partitions of n into distinct primes.
- Number of leaves on the rooted tree of height n constructed by the following rule. Assign weight 1 to the single node at height 1. At each node of weight w at height k>0, branch to nodes at height k+1 as follows: one node of weight 1 and a node of weight d+1 if d divides w.A054657
Number of leaves on the rooted tree of height n constructed by the following rule. Assign weight 1 to the single node at height 1. At each node of weight w at height k>0, branch to nodes at height k+1 as follows: one node of weight 1 and a node of weight d+1 if d divides w.
- Primes beginning 1, 3, 7, 9 whose reversals are nonprimes.A054658
Primes beginning 1, 3, 7, 9 whose reversals are nonprimes.
- Increasing sequence with no repeating digits and no digits shared with previous term.A054659
Increasing sequence with no repeating digits and no digits shared with previous term.
- Number of monic irreducible polynomials over GF(4) of degree n with fixed nonzero trace.A054660
Number of monic irreducible polynomials over GF(4) of degree n with fixed nonzero trace.