Sequences
392,541 sequences
- Numbers k such that 6*k-1 and 6*k+1 are twin composites.A060461
Numbers k such that 6*k-1 and 6*k+1 are twin composites.
- Integers k such that k! is divisible by k*(k+1)/2.A060462
Integers k such that k! is divisible by k*(k+1)/2.
- Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.A060463
Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.
- Numbers that are not congruent to 4 or 5 mod 9.A060464
Numbers that are not congruent to 4 or 5 mod 9.
- Value of x of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.A060465
Value of x of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.
- Value of y of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.A060466
Value of y of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.
- Value of z of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.A060467
Value of z of the solution to x^3 + y^3 + z^3 = A060464(n) (numbers not 4 or 5 mod 9) with smallest |z| and smallest |y|, 0 <= |x| <= |y| <= |z|.
- Number of fair distributions (equal sum) of the integers {1,..,4n} between A and B = number of solutions to the equation {+-1 +-2 +- 3 ... +-4*n = 0}.A060468
Number of fair distributions (equal sum) of the integers {1,..,4n} between A and B = number of solutions to the equation {+-1 +-2 +- 3 ... +-4*n = 0}.
- Smallest positive a(n) such that number of solutions to a(n) = a(j)+a(k) j<k<n is one or less.A060469
Smallest positive a(n) such that number of solutions to a(n) = a(j)+a(k) j<k<n is one or less.
- Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is two or less.A060470
Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is two or less.
- Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is three or less.A060471
Smallest positive a(n) such that number of solutions to a(n)=a(j)+a(k) j<k<n is three or less.
- Smallest positive a(n) such that the number of solutions to a(n)=a(j)+a(k), j<k<n is four or less.A060472
Smallest positive a(n) such that the number of solutions to a(n)=a(j)+a(k), j<k<n is four or less.
- a(n) = numerator of phi(n)/(n+1), where phi(n) is Euler's phi, A000010.A060473
a(n) = numerator of phi(n)/(n+1), where phi(n) is Euler's phi, A000010.
- a(n) = denominator of phi(n)/(n+1), where phi(n) is Euler's phi, A000010.A060474
a(n) = denominator of phi(n)/(n+1), where phi(n) is Euler's phi, A000010.
- Triangular array formed from successive differences of factorial numbers, then with factorials removed.A060475
Triangular array formed from successive differences of factorial numbers, then with factorials removed.
- Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that 1 + max{e_2, e_3, ...} is nonprime.A060476
Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that 1 + max{e_2, e_3, ...} is nonprime.
- Number of orbits of length n in map whose periodic points are A000051.A060477
Number of orbits of length n in map whose periodic points are A000051.
- Number of orbits of length n in map whose periodic points are A059928.A060478
Number of orbits of length n in map whose periodic points are A059928.
- Number of orbits of length n in map whose periodic points come from A006954.A060479
Number of orbits of length n in map whose periodic points come from A006954.
- Number of orbits of length n in map whose periodic points come from A059990.A060480
Number of orbits of length n in map whose periodic points come from A059990.
- Number of orbits of length n in a map whose periodic points come from A059991.A060481
Number of orbits of length n in a map whose periodic points come from A059991.
- New record highs reached in A060030.A060482
New record highs reached in A060030.
- Number of 5-block tricoverings of an n-set.A060483
Number of 5-block tricoverings of an n-set.
- Number of 6-block tricoverings of an n-set.A060484
Number of 6-block tricoverings of an n-set.
- Number of 7-block tricoverings of an n-set.A060485
Number of 7-block tricoverings of an n-set.
- Tricoverings of an n-set.A060486
Tricoverings of an n-set.
- Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).A060487
Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).
- Number of 4-block ordered tricoverings of an unlabeled n-set.A060488
Number of 4-block ordered tricoverings of an unlabeled n-set.
- Number of 5-block ordered tricoverings of an unlabeled n-set.A060489
Number of 5-block ordered tricoverings of an unlabeled n-set.
- Number of 6-block ordered tricoverings of an unlabeled n-set.A060490
Number of 6-block ordered tricoverings of an unlabeled n-set.
- Number of ordered tricoverings of an unlabeled n-set.A060491
Number of ordered tricoverings of an unlabeled n-set.
- Triangle T(n,k) of k-block ordered tricoverings of an unlabeled n-set (n >= 3, k = 4..2n).A060492
Triangle T(n,k) of k-block ordered tricoverings of an unlabeled n-set (n >= 3, k = 4..2n).
- A diagonal of A036969.A060493
A diagonal of A036969.
- a(n) = floor(n^4/64).A060494
a(n) = floor(n^4/64).
- Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.A060495
Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.
- Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's.A060496
Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's.
- a(n) = binomial(2^n, prime(n)).A060497
a(n) = binomial(2^n, prime(n)).
- Each permutation in the list A060117 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.A060498
Each permutation in the list A060117 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.
- Each permutation in the list A060118 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.A060499
Each permutation in the list A060118 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.
- a(n) = number of drops in the n-th permutation of list A060118; the average of digits (where "digits" may eventually obtain also any values > 9) in each siteswap pattern A060496(n).A060500
a(n) = number of drops in the n-th permutation of list A060118; the average of digits (where "digits" may eventually obtain also any values > 9) in each siteswap pattern A060496(n).
- Average of digits of each term in A060495, number of balls in each such siteswap juggling pattern.A060501
Average of digits of each term in A060495, number of balls in each such siteswap juggling pattern.
- a(n) = number of occupied digit slopes in the factorial base representation of n (see comments for the definition); number of drops in the n-th permutation of list A060117.A060502
a(n) = number of occupied digit slopes in the factorial base representation of n (see comments for the definition); number of drops in the n-th permutation of list A060117.
- Primes p that have a primitive root between 0 and p that is not a primitive root of p^2.A060503
Primes p that have a primitive root between 0 and p that is not a primitive root of p^2.
- Let p be a prime that has a primitive root between 0 and p that is not also a primitive root of p^2 (A060503); sequence gives smallest such primitive root.A060504
Let p be a prime that has a primitive root between 0 and p that is not also a primitive root of p^2 (A060503); sequence gives smallest such primitive root.
- a(n) = floor(2^n/(n^2)).A060505
a(n) = floor(2^n/(n^2)).
- Numerators of the asymptotic expansion of the Airy function Ai(x).A060506
Numerators of the asymptotic expansion of the Airy function Ai(x).
- Denominators of the asymptotic expansion of the Airy function Ai(x).A060507
Denominators of the asymptotic expansion of the Airy function Ai(x).
- Exponent of largest power of n < 2^n.A060508
Exponent of largest power of n < 2^n.
- Largest power of n not exceeding 2^n.A060509
Largest power of n not exceeding 2^n.
- Alternating with hexagonal stutters: if n is hexagonal (2k^2 - k, i.e., A000384) then a(n)=a(n-1), otherwise a(n) = 1 - a(n-1).A060510
Alternating with hexagonal stutters: if n is hexagonal (2k^2 - k, i.e., A000384) then a(n)=a(n-1), otherwise a(n) = 1 - a(n-1).