Sequences
392,541 sequences
- The floor(n^(.9999))-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.A066361
The floor(n^(.9999))-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.
- a(n) = least k > n such that phi(k) < phi(n), if such a k exists; otherwise a(n) = 0.A066362
a(n) = least k > n such that phi(k) < phi(n), if such a k exists; otherwise a(n) = 0.
- The floor[n^(3/4)]-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.A066363
The floor[n^(3/4)]-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.
- Prime divisors of solutions to 10^n == 1 (mod n).A066364
Prime divisors of solutions to 10^n == 1 (mod n).
- f-perfect numbers, where f(m) = sigma(m)-m.A066365
f-perfect numbers, where f(m) = sigma(m)-m.
- Primes which are the sum of a prime number of consecutive primes in a prime number of different ways.A066366
Primes which are the sum of a prime number of consecutive primes in a prime number of different ways.
- The floor(prime(n)/n)-perfect numbers, where prime(n) denotes the n-th prime and f-perfect numbers for an arithmetical function f are defined in A066218.A066367
The floor(prime(n)/n)-perfect numbers, where prime(n) denotes the n-th prime and f-perfect numbers for an arithmetical function f are defined in A066218.
- a(n) = (n+2)*2^(n-1) - 2*n.A066368
a(n) = (n+2)*2^(n-1) - 2*n.
- Number of subsets of {1, ..., n} with no four terms in arithmetic progression.A066369
Number of subsets of {1, ..., n} with no four terms in arithmetic progression.
- Quadruply triangular numbers.A066370
Quadruply triangular numbers.
- Smallest positive square that contains n consecutive internal 0's.A066371
Smallest positive square that contains n consecutive internal 0's.
- Number of different shapes formed by bending a piece of wire of length n in the plane.A066372
Number of different shapes formed by bending a piece of wire of length n in the plane.
- a(n) = (3*n-2)*2^(n-3).A066373
a(n) = (3*n-2)*2^(n-3).
- a(n) = (3*n+4)*2^(n-3)-(2*n-1).A066374
a(n) = (3*n+4)*2^(n-3)-(2*n-1).
- a(n) = 6*binomial(n,4) + 3*binomial(n,3) + 4*binomial(n,2) - n + 2.A066375
a(n) = 6*binomial(n,4) + 3*binomial(n,3) + 4*binomial(n,2) - n + 2.
- Number of [*]-divisors d <= n such that there is another [*]-divisor d' < n with d [*] d' = n.A066376
Number of [*]-divisors d <= n such that there is another [*]-divisor d' < n with d [*] d' = n.
- Number of numbers m <= n such that floor(sqrt(m)) divides m.A066377
Number of numbers m <= n such that floor(sqrt(m)) divides m.
- Floor(log(n)) divides n.A066378
Floor(log(n)) divides n.
- Sum of the first n numbers m such that floor(log(m)) divides m.A066379
Sum of the first n numbers m such that floor(log(m)) divides m.
- a(n) = Sum_{k=0..n} binomial(3*n,k).A066380
a(n) = Sum_{k=0..n} binomial(3*n,k).
- a(n) = Sum_{k=0..n} binomial(4*n,k).A066381
a(n) = Sum_{k=0..n} binomial(4*n,k).
- a(n) = Sum_{k=0..n} binomial(n^2,k).A066382
a(n) = Sum_{k=0..n} binomial(n^2,k).
- a(n) = Sum_{k=0..n} C(n*(n+1)/2,k).A066383
a(n) = Sum_{k=0..n} C(n*(n+1)/2,k).
- a(n) = Sum_{k=0..n} binomial(2^n,k).A066384
a(n) = Sum_{k=0..n} binomial(2^n,k).
- Smallest maximum of sum of 3 consecutive terms in any arrangement of [1..n] in a circle.A066385
Smallest maximum of sum of 3 consecutive terms in any arrangement of [1..n] in a circle.
- Numbers k such that k^6 + 1091 is prime.A066386
Numbers k such that k^6 + 1091 is prime.
- Triangle T(n,m) (1<=m<=n) giving number of maps f:N -> N such that f^m(X)=X+n for all natural numbers X.A066387
Triangle T(n,m) (1<=m<=n) giving number of maps f:N -> N such that f^m(X)=X+n for all natural numbers X.
- Numbers j such that j and 2j are both between a pair of twin primes.A066388
Numbers j such that j and 2j are both between a pair of twin primes.
- Number of 2-generated groups of order n: groups that have a generating set of size <=2, i.e., are cyclic or of the form <a,b>.A066389
Number of 2-generated groups of order n: groups that have a generating set of size <=2, i.e., are cyclic or of the form <a,b>.
- Smallest cube that contains exactly n consecutive internal 0's and no other 0's.A066390
Smallest cube that contains exactly n consecutive internal 0's and no other 0's.
- a(n)^3 is smallest cube that contains exactly n consecutive internal 0's and no other 0's.A066391
a(n)^3 is smallest cube that contains exactly n consecutive internal 0's and no other 0's.
- a(n)^2 is the smallest positive square that contains n consecutive internal 0's.A066392
a(n)^2 is the smallest positive square that contains n consecutive internal 0's.
- Coordination sequence for (9^3, 3.9^2) net with respect to a vertex of type 9^3.A066393
Coordination sequence for (9^3, 3.9^2) net with respect to a vertex of type 9^3.
- Coordination sequence for ReO_3 net with respect to oxygen atom O_1.A066394
Coordination sequence for ReO_3 net with respect to oxygen atom O_1.
- Expansion of reciprocal of j-function (see A000521).A066395
Expansion of reciprocal of j-function (see A000521).
- Reversion of j-function (see A000521).A066396
Reversion of j-function (see A000521).
- Reversion of 1 / sqrt(1 - 4*x) (the o.g.f. for the central binomial coefficients A000984) as if it were an e.g.f.A066397
Reversion of 1 / sqrt(1 - 4*x) (the o.g.f. for the central binomial coefficients A000984) as if it were an e.g.f.
- Reversion of g.f. (with constant term included) for partition numbers.A066398
Reversion of g.f. (with constant term included) for partition numbers.
- From reversion of e.g.f. for squares.A066399
From reversion of e.g.f. for squares.
- Smallest values of t arising in R. L. Graham's sequence (A006255).A066400
Smallest values of t arising in R. L. Graham's sequence (A006255).
- Square root of b_1*b_2*...*b_t corresponding to smallest values of t in R. L. Graham's sequence (A006255).A066401
Square root of b_1*b_2*...*b_t corresponding to smallest values of t in R. L. Graham's sequence (A006255).
- From expansion of Belyi function for dodecahedron.A066402
From expansion of Belyi function for dodecahedron.
- From expansion of Belyi function for cube.A066403
From expansion of Belyi function for cube.
- From expansion of Belyi function for icosahedron.A066404
From expansion of Belyi function for icosahedron.
- From expansion of Belyi function for octahedron.A066405
From expansion of Belyi function for octahedron.
- a(n) = 2^n*(3^n-3).A066406
a(n) = 2^n*(3^n-3).
- Number of orthogonal arrays OA(6,n,2,1).A066407
Number of orthogonal arrays OA(6,n,2,1).
- Numbers n such that the Eisenstein integer (1 - ω)^n - 1 has prime norm, where ω = -1/2 + sqrt(-3)/2.A066408
Numbers n such that the Eisenstein integer (1 - ω)^n - 1 has prime norm, where ω = -1/2 + sqrt(-3)/2.
- Least positive integer not representable using exactly n 9's and the operations +-*/().A066409
Least positive integer not representable using exactly n 9's and the operations +-*/().
- Maximal sum of divisors of any n-digit number.A066410
Maximal sum of divisors of any n-digit number.