Sequences
392,541 sequences
- Sum of divisors of n-th term of Look and Say Sequence A005150.A079561
Sum of divisors of n-th term of Look and Say Sequence A005150.
- Number of distinct prime factors of n-th term of Look and Say Sequence A005150.A079562
Number of distinct prime factors of n-th term of Look and Say Sequence A005150.
- a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=7.A079563
a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=7.
- Number of unlabeled connected simple graphs on n vertices with no induced subgraphs isomorphic to a P5 or complement of a P5 (P5 = path on 5 vertices.).A079564
Number of unlabeled connected simple graphs on n vertices with no induced subgraphs isomorphic to a P5 or complement of a P5 (P5 = path on 5 vertices.).
- Number of unlabeled and connected graphs on n vertices which are either bipartite or co-bipartite.A079565
Number of unlabeled and connected graphs on n vertices which are either bipartite or co-bipartite.
- Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a C4 (cycle on 4 vertices.)A079566
Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a C4 (cycle on 4 vertices.)
- Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite and are primes.A079567
Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite and are primes.
- Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.A079568
Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.
- Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5 and are chordal and prime.A079569
Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5 and are chordal and prime.
- Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a cricket graph (open bow-tie graph).A079570
Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a cricket graph (open bow-tie graph).
- Number of unlabeled, connected graphs on n vertices whose complements are bipartite.A079571
Number of unlabeled, connected graphs on n vertices whose complements are bipartite.
- Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a paw, where the paw is the graph on 4 vertices, 3 of which form a triangle and the 4th vertex is adjacent to exactly one of those 3.A079572
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a paw, where the paw is the graph on 4 vertices, 3 of which form a triangle and the 4th vertex is adjacent to exactly one of those 3.
- Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a diamond, where a diamond is the graph on four vertices formed by removing an edge from the complete graph K4.A079573
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a diamond, where a diamond is the graph on four vertices formed by removing an edge from the complete graph K4.
- Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a K_4, where a K_4 is the complete graph on four vertices.A079574
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a K_4, where a K_4 is the complete graph on four vertices.
- Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a bull-graph.A079575
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a bull-graph.
- Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a gem, where a gem is a 4-path with a fifth vertex adjacent to all four of the vertices in the path.A079576
Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a gem, where a gem is a 4-path with a fifth vertex adjacent to all four of the vertices in the path.
- Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a bull, a P5 or a P5-bar.A079577
Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a bull, a P5 or a P5-bar.
- Least number coprime to n and greater than n+1.A079578
Least number coprime to n and greater than n+1.
- Totally multiplicative with p -> (p-1)*p, p prime.A079579
Totally multiplicative with p -> (p-1)*p, p prime.
- a(n)= Sum_{d divides n} a(abs(n/d-d)).A079580
a(n)= Sum_{d divides n} a(abs(n/d-d)).
- Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the s values; A079673 gives the r values.A079581
Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the s values; A079673 gives the r values.
- Least positive k such that the distance from k to closest prime = n.A079582
Least positive k such that the distance from k to closest prime = n.
- a(n) = 3*2^n - n - 2.A079583
a(n) = 3*2^n - n - 2.
- Number of ones in the binary expansion of n!.A079584
Number of ones in the binary expansion of n!.
- Decimal expansion of c = (7-sqrt(5))/2.A079585
Decimal expansion of c = (7-sqrt(5))/2.
- Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).A079586
Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).
- Continued fraction expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).A079587
Continued fraction expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).
- a(n) = (n+1)*(2*n+1)*(4*n+1).A079588
a(n) = (n+1)*(2*n+1)*(4*n+1).
- a(n) = C(5*n+1,n).A079589
a(n) = C(5*n+1,n).
- a(n) = C(6*n+1,n).A079590
a(n) = C(6*n+1,n).
- Decimal expansion of x such that Sum_{k>=1} x^Fibonacci(k) = 1.A079591
Decimal expansion of x such that Sum_{k>=1} x^Fibonacci(k) = 1.
- Primes p such that floor(Pi*p) is prime.A079592
Primes p such that floor(Pi*p) is prime.
- Primes equal to floor(Pi*x) where x is prime.A079593
Primes equal to floor(Pi*x) where x is prime.
- Primes p such that floor(p^Pi) is prime.A079594
Primes p such that floor(p^Pi) is prime.
- Primes of the form floor(x^Pi) where x is prime.A079595
Primes of the form floor(x^Pi) where x is prime.
- Number of ways to get ten-pin bowling score of 300-n.A079596
Number of ways to get ten-pin bowling score of 300-n.
- a(n) = 2^((n-1)*(2^n-1)).A079597
a(n) = 2^((n-1)*(2^n-1)).
- a(n) = 2^(4n+1) - 2^(2n).A079598
a(n) = 2^(4n+1) - 2^(2n).
- Numbers n for which the n-th impartial game is a second player win.A079599
Numbers n for which the n-th impartial game is a second player win.
- a(n) = A000670(p-1)/p with p = prime(n+1).A079600
a(n) = A000670(p-1)/p with p = prime(n+1).
- (A000670(2*p - 1) - 1)/(6*p) where p runs through the primes.A079601
(A000670(2*p - 1) - 1)/(6*p) where p runs through the primes.
- Greatest of smallest odd prime factors of all composite numbers between n-th prime and next prime.A079602
Greatest of smallest odd prime factors of all composite numbers between n-th prime and next prime.
- "Trim" numbers: see reference for definition.A079603
"Trim" numbers: see reference for definition.
- Marks on lexicographically earliest 17-mark optimal Golomb ruler.A079604
Marks on lexicographically earliest 17-mark optimal Golomb ruler.
- Marks on lexicographically earliest 18-mark optimal Golomb ruler.A079605
Marks on lexicographically earliest 18-mark optimal Golomb ruler.
- Marks on lexicographically earliest 19-mark optimal Golomb ruler.A079606
Marks on lexicographically earliest 19-mark optimal Golomb ruler.
- Marks on lexicographically earliest 20-mark optimal Golomb ruler.A079607
Marks on lexicographically earliest 20-mark optimal Golomb ruler.
- Marks on lexicographically earliest 21-mark optimal Golomb ruler.A079608
Marks on lexicographically earliest 21-mark optimal Golomb ruler.
- a(n) = (b(p)-2)/p where b(k) denotes Bell numbers and p = prime(n).A079609
a(n) = (b(p)-2)/p where b(k) denotes Bell numbers and p = prime(n).
- a(n) = (5*n+1)*(5*n+3)*(5*n+5).A079610
a(n) = (5*n+1)*(5*n+3)*(5*n+5).