Sequences
392,541 sequences
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 12 1-simplexes.A054561
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 12 1-simplexes.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 13 1-simplexes.A054562
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 13 1-simplexes.
- a(n) = n*(n^2 - 1)*(n + 2)*(n^2 + 4*n + 6)/72.A054563
a(n) = n*(n^2 - 1)*(n + 2)*(n^2 + 4*n + 6)/72.
- Prime number spiral (clockwise, Southeast spoke).A054564
Prime number spiral (clockwise, Southeast spoke).
- Numbers n such that 3 is the first digit of 3^n.A054565
Numbers n such that 3 is the first digit of 3^n.
- Prime number spiral (clockwise, South spoke).A054566
Prime number spiral (clockwise, South spoke).
- a(n) = 4*n^2 - 7*n + 4.A054567
a(n) = 4*n^2 - 7*n + 4.
- Prime number spiral (clockwise, Southwest spoke).A054568
Prime number spiral (clockwise, Southwest spoke).
- a(n) = 4*n^2 - 6*n + 3.A054569
a(n) = 4*n^2 - 6*n + 3.
- Prime number spiral (clockwise, West spoke).A054570
Prime number spiral (clockwise, West spoke).
- a(n) = phi(n - phi(n)), a(1) = 0.A054571
a(n) = phi(n - phi(n)), a(1) = 0.
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).A054572
Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).
- Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).A054573
Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).
- Begin with n-th prime, add its prime divisors (itself), repeat until reach a new prime; sequence gives prime reached.A054574
Begin with n-th prime, add its prime divisors (itself), repeat until reach a new prime; sequence gives prime reached.
- Number of iterations to reach new prime in A054574.A054575
Number of iterations to reach new prime in A054574.
- Largest proper factor of the largest proper factor of n.A054576
Largest proper factor of the largest proper factor of n.
- A Catalan-like sequence.A054577
A Catalan-like sequence.
- Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).A054578
Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).
- n^2+n modulo 17.A054579
n^2+n modulo 17.
- n^2 modulo 17.A054580
n^2 modulo 17.
- Number of unlabeled 2-trees with n nodes.A054581
Number of unlabeled 2-trees with n nodes.
- Array read by antidiagonals upwards: A(m,k) = 2^m * (2k+1), m,k >= 0.A054582
Array read by antidiagonals upwards: A(m,k) = 2^m * (2k+1), m,k >= 0.
- Number of nonisomorphic acyclic orientations of the Hamming graph (K_n) x (K_n).A054583
Number of nonisomorphic acyclic orientations of the Hamming graph (K_n) x (K_n).
- Number of subgroups of the group generated by a^n=1, b^3=1 and ab=ba.A054584
Number of subgroups of the group generated by a^n=1, b^3=1 and ab=ba.
- Sum_{d=1..n} phi(d)*mu(d).A054585
Sum_{d=1..n} phi(d)*mu(d).
- a(n) = Sum_{d|2n+1} phi(d)*mu(d).A054586
a(n) = Sum_{d|2n+1} phi(d)*mu(d).
- n-th occurrence of gap of n between primes occurs at prime a(n), n even, n >= 2.A054587
n-th occurrence of gap of n between primes occurs at prime a(n), n even, n >= 2.
- Length of gap between consecutive primes containing n!.A054588
Length of gap between consecutive primes containing n!.
- Table related to labeled rooted trees, cycles and binary trees.A054589
Table related to labeled rooted trees, cycles and binary trees.
- Number of disconnected digraphs with n unlabeled nodes.A054590
Number of disconnected digraphs with n unlabeled nodes.
- Denominators of rational numbers that belong to the Cantor set.A054591
Denominators of rational numbers that belong to the Cantor set.
- Number of disconnected labeled graphs with n nodes.A054592
Number of disconnected labeled graphs with n nodes.
- Number of disconnected labeled digraphs with n nodes.A054593
Number of disconnected labeled digraphs with n nodes.
- Number of labeled minimally 2-connected graphs by nodes.A054594
Number of labeled minimally 2-connected graphs by nodes.
- Number of labeled 2-connected minimally 2-edge-connected graphs by nodes.A054595
Number of labeled 2-connected minimally 2-edge-connected graphs by nodes.
- Number of labeled minimally 2-edge-connected graphs by nodes.A054596
Number of labeled minimally 2-edge-connected graphs by nodes.
- Number of labeled 2-connected 3-edge-connected graphs by nodes.A054597
Number of labeled 2-connected 3-edge-connected graphs by nodes.
- a(0)=0; for n>0, a(n) = Sum_{d|n} d*2^(n/d).A054598
a(0)=0; for n>0, a(n) = Sum_{d|n} d*2^(n/d).
- a(n) = Sum_{d|n} d*2^(n/d - 1).A054599
a(n) = Sum_{d|n} d*2^(n/d - 1).
- Sum_{d|n, d odd} d*2^(n/d).A054600
Sum_{d|n, d odd} d*2^(n/d).
- a(n) = Sum_{d|n, d odd} d*2^(n/d - 1), a(0)=0.A054601
a(n) = Sum_{d|n, d odd} d*2^(n/d - 1), a(0)=0.
- a(n) = Sum_{d|3} phi(d)*n^(3/d).A054602
a(n) = Sum_{d|3} phi(d)*n^(3/d).
- a(n) = Sum_{d|4} phi(d)*n^(4/d).A054603
a(n) = Sum_{d|4} phi(d)*n^(4/d).
- a(n) = Sum_{d|5} phi(d)*n^(5/d).A054604
a(n) = Sum_{d|5} phi(d)*n^(5/d).
- a(n) = Sum_{d|6} phi(d)*n^(6/d).A054605
a(n) = Sum_{d|6} phi(d)*n^(6/d).
- a(n) = Sum_{d|7} phi(d)*n^(7/d).A054606
a(n) = Sum_{d|7} phi(d)*n^(7/d).
- a(n) = Sum_{d|8} phi(d)*n^(8/d).A054607
a(n) = Sum_{d|8} phi(d)*n^(8/d).
- a(n) = Sum_{d|9} phi(d)*n^(9/d).A054608
a(n) = Sum_{d|9} phi(d)*n^(9/d).
- a(n) = Sum_{d|10} phi(d)*n^(10/d).A054609
a(n) = Sum_{d|10} phi(d)*n^(10/d).
- a(n) = Sum_{d|n} phi(d)*3^(n/d).A054610
a(n) = Sum_{d|n} phi(d)*3^(n/d).