Sequences
392,541 sequences
- Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on two generators that require exactly k multiplications for their formation.A076261
Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on two generators that require exactly k multiplications for their formation.
- Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.A076262
Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.
- Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).A076263
Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).
- Number of ternary (0,1,2) sequences without a consecutive '012'.A076264
Number of ternary (0,1,2) sequences without a consecutive '012'.
- a(n) = Product_{i=1..n} prime(i)^prime(i).A076265
a(n) = Product_{i=1..n} prime(i)^prime(i).
- Largest k such that A005132(n+2*i) = A005132(n) - i for any 0<=i<=k.A076266
Largest k such that A005132(n+2*i) = A005132(n) - i for any 0<=i<=k.
- Numbers n such that A005185(n) divides n.A076267
Numbers n such that A005185(n) divides n.
- Sum(k=1,n, A005185(k)).A076268
Sum(k=1,n, A005185(k)).
- Size of largest antichain in partition lattice Par(n).A076269
Size of largest antichain in partition lattice Par(n).
- Numbers of the form (3^{mr}-1)/(3^r-1) for positive integers m, r.A076270
Numbers of the form (3^{mr}-1)/(3^r-1) for positive integers m, r.
- a(1) = 1, a(2) = 2, and for n > 2, a(n) = a(n-1) + gpf(a(n-1)), where gpf = greatest prime factor = A006530.A076271
a(1) = 1, a(2) = 2, and for n > 2, a(n) = a(n-1) + gpf(a(n-1)), where gpf = greatest prime factor = A006530.
- Largest prime factor of A076271(n): A006530(A076271(n)).A076272
Largest prime factor of A076271(n): A006530(A076271(n)).
- a(0) = 1, a(1) = 2; for n>1, a(n) = prime(n)+prime(n-1)-1.A076273
a(0) = 1, a(1) = 2; for n>1, a(n) = prime(n)+prime(n-1)-1.
- 2p-1 where p is 1 or a prime.A076274
2p-1 where p is 1 or a prime.
- Numbers of the form (4^{mr}-1)/(4^r-1) for positive integers m, r.A076275
Numbers of the form (4^{mr}-1)/(4^r-1) for positive integers m, r.
- Number of + signs needed to write the partitions of n (A000041) as sums.A076276
Number of + signs needed to write the partitions of n (A000041) as sums.
- Number of product signs needed to write all the factorizations of n with all factors > 1.A076277
Number of product signs needed to write all the factorizations of n with all factors > 1.
- Number of 2-chromatic (i.e., chromatic number equals 2) simple graphs on n nodes.A076278
Number of 2-chromatic (i.e., chromatic number equals 2) simple graphs on n nodes.
- Number of 3-chromatic (i.e., chromatic number equals 3) simple graphs on n nodes.A076279
Number of 3-chromatic (i.e., chromatic number equals 3) simple graphs on n nodes.
- Number of 4-chromatic (i.e., chromatic number equals 4) simple graphs on n nodes.A076280
Number of 4-chromatic (i.e., chromatic number equals 4) simple graphs on n nodes.
- Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes.A076281
Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes.
- Number of 6-chromatic (i.e., chromatic number equals 6) simple graphs on n nodes.A076282
Number of 6-chromatic (i.e., chromatic number equals 6) simple graphs on n nodes.
- Number of 7-chromatic (i.e., chromatic number equals 7) simple graphs on n nodes.A076283
Number of 7-chromatic (i.e., chromatic number equals 7) simple graphs on n nodes.
- Numbers of the form (5^{mr}-1)/(5^r-1) for positive integers m, r.A076284
Numbers of the form (5^{mr}-1)/(5^r-1) for positive integers m, r.
- Numbers of the form (6^{mr}-1)/(6^r-1) for positive integers m, r.A076285
Numbers of the form (6^{mr}-1)/(6^r-1) for positive integers m, r.
- Numbers of the form (7^{mr}-1)/(7^r-1) for positive integers m, r.A076286
Numbers of the form (7^{mr}-1)/(7^r-1) for positive integers m, r.
- Numbers of the form (8^{mr}-1)/(8^r-1) for positive integers m, r.A076287
Numbers of the form (8^{mr}-1)/(8^r-1) for positive integers m, r.
- Numbers of the form (9^{mr}-1)/(9^r-1) for positive integers m, r.A076288
Numbers of the form (9^{mr}-1)/(9^r-1) for positive integers m, r.
- Numbers of the form (10^(m*r)-1)/(10^r-1) for positive integers m, r.A076289
Numbers of the form (10^(m*r)-1)/(10^r-1) for positive integers m, r.
- Sum of the semiprime divisors of n.A076290
Sum of the semiprime divisors of n.
- a(n) = A002977(n+1) - A002977(n).A076291
a(n) = A002977(n+1) - A002977(n).
- Perfect powers with squarefree root.A076292
Perfect powers with squarefree root.
- Numbers k where the root mean square (RMS) of k and 7 is an integer, i.e., sqrt((k^2 + 7^2)/2) is an integer.A076293
Numbers k where the root mean square (RMS) of k and 7 is an integer, i.e., sqrt((k^2 + 7^2)/2) is an integer.
- Consider all Pythagorean triples (X,X+7,Z); sequence gives Z values.A076294
Consider all Pythagorean triples (X,X+7,Z); sequence gives Z values.
- Consider all Pythagorean triples (Y-7,Y,Z); sequence gives Y values.A076295
Consider all Pythagorean triples (Y-7,Y,Z); sequence gives Y values.
- Consider all Pythagorean triples (X,X+7,Z); sequence gives X values.A076296
Consider all Pythagorean triples (X,X+7,Z); sequence gives X values.
- Numbers k such that prime(k) + s*k is prime, s=2.A076297
Numbers k such that prime(k) + s*k is prime, s=2.
- Numbers k such that prime(k) + s*k is prime, s=3.A076298
Numbers k such that prime(k) + s*k is prime, s=3.
- Numbers k such that prime(k) + s*k is prime, s=4.A076299
Numbers k such that prime(k) + s*k is prime, s=4.
- Numbers k such that prime(k) + s*k is prime, s=5.A076300
Numbers k such that prime(k) + s*k is prime, s=5.
- Related to number of labeled partially ordered sets.A076301
Related to number of labeled partially ordered sets.
- Triangle T(n,k) = number of k-smooth divisors of n, read by rows.A076302
Triangle T(n,k) = number of k-smooth divisors of n, read by rows.
- Engel expansion of exp(Pi * sqrt(163)) - 262537412640768743.A076303
Engel expansion of exp(Pi * sqrt(163)) - 262537412640768743.
- Numbers k such that k^2 is a sum of three successive primes.A076304
Numbers k such that k^2 is a sum of three successive primes.
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a square.A076305
Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a square.
- Numbers k such that k^3 is a sum of three successive primes.A076306
Numbers k such that k^3 is a sum of three successive primes.
- a(n) = n+min(2*floor(a(n-1)/2), 3*floor(a(n-1)/3)) for n > 1, a(1)=1.A076307
a(n) = n+min(2*floor(a(n-1)/2), 3*floor(a(n-1)/3)) for n > 1, a(1)=1.
- Product of 10-adic numbers defined in A018247 and A018248.A076308
Product of 10-adic numbers defined in A018247 and A018248.
- a(n) = floor(n/10) - 2*(n mod 10).A076309
a(n) = floor(n/10) - 2*(n mod 10).
- a(n) = floor(n/10) + 4*(n mod 10).A076310
a(n) = floor(n/10) + 4*(n mod 10).