Sequences
392,541 sequences
- Numerators of coefficients in (1+x)^(1/3)-(1-x)^(1/3) power series.A068561
Numerators of coefficients in (1+x)^(1/3)-(1-x)^(1/3) power series.
- Denominators of coefficients in (1+x)^(1/3)-(1-x)^(1/3) power series.A068562
Denominators of coefficients in (1+x)^(1/3)-(1-x)^(1/3) power series.
- Numbers k such that 2^k == 4^k (mod k).A068563
Numbers k such that 2^k == 4^k (mod k).
- Numbers k such that phi(k) = 2*tau(k)^2.A068564
Numbers k such that phi(k) = 2*tau(k)^2.
- Denominators of Sum_{k=1..n} 1/(k * 2^k).A068565
Denominators of Sum_{k=1..n} 1/(k * 2^k).
- Numerator of Sum_{k=1..n} 1/(k * 2^k).A068566
Numerator of Sum_{k=1..n} 1/(k * 2^k).
- Numbers k such that gpf(k) < k/gpf(k) and gpf(k/gpf(k)) < gpf(k), where gpf(n) is the greatest prime factor of n, A006530.A068567
Numbers k such that gpf(k) < k/gpf(k) and gpf(k/gpf(k)) < gpf(k), where gpf(n) is the greatest prime factor of n, A006530.
- Let S = a subset of {n,n+1,n+2,..,n+m}, number of parts of S is more than 1. a(n) = smallest number m such that the product of parts of S is a square.A068568
Let S = a subset of {n,n+1,n+2,..,n+m}, number of parts of S is more than 1. a(n) = smallest number m such that the product of parts of S is a square.
- Positive numbers that are not the ratio of any n/(number of letters to express n in English).A068569
Positive numbers that are not the ratio of any n/(number of letters to express n in English).
- Numbers divisible by the number of letters to express them in English.A068570
Numbers divisible by the number of letters to express them in English.
- Number of happy numbers <= 10^n.A068571
Number of happy numbers <= 10^n.
- Numbers n such that sigma(n) = product of the squares of the decimal digits of n.A068572
Numbers n such that sigma(n) = product of the squares of the decimal digits of n.
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.A068573
a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.
- Numbers k such that, treated as a string, k is a substring of Fibonacci(k).A068574
Numbers k such that, treated as a string, k is a substring of Fibonacci(k).
- Numbers n such that, as strings, n is a substring of prime(n).A068575
Numbers n such that, as strings, n is a substring of prime(n).
- Numbers k such that Sum_{j=1..k} mu(j)^2 = floor(6*k/Pi^2).A068576
Numbers k such that Sum_{j=1..k} mu(j)^2 = floor(6*k/Pi^2).
- Numbers k such that tau(k)^2 > phi(k).A068577
Numbers k such that tau(k)^2 > phi(k).
- Numbers k such that tau(k)*sigma(k) > k*phi(k).A068578
Numbers k such that tau(k)*sigma(k) > k*phi(k).
- Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_3(k) = tau(k).A068579
Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_3(k) = tau(k).
- Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_2(k) = tau(k).A068580
Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_2(k) = tau(k).
- Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_4(k) = tau(k).A068581
Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_4(k) = tau(k).
- Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_5(k) = tau(k).A068582
Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_5(k) = tau(k).
- Let p and q be distinct primes such that p^x - q^y = 2^h with h>=0, x>1, y>1. Sequence gives p^x arranged in increasing order.A068583
Let p and q be distinct primes such that p^x - q^y = 2^h with h>=0, x>1, y>1. Sequence gives p^x arranged in increasing order.
- Numbers k such that the denominator of (Sum_{j=1..k} 1/j)^2 equals the denominator of Sum_{j=1..k} 1/j^2.A068584
Numbers k such that the denominator of (Sum_{j=1..k} 1/j)^2 equals the denominator of Sum_{j=1..k} 1/j^2.
- Numbers k such that the denominator of (Sum_{j=1..k} 1/j)^3 equals the denominator of Sum_{j=1..k} 1/j^3.A068585
Numbers k such that the denominator of (Sum_{j=1..k} 1/j)^3 equals the denominator of Sum_{j=1..k} 1/j^3.
- Duplicate of A068585.A068586
Duplicate of A068585.
- Multiplicative 3-wave sequence starting with 1,2,3.A068587
Multiplicative 3-wave sequence starting with 1,2,3.
- Treated as strings, n and its reversal are substrings of 2^n.A068588
Treated as strings, n and its reversal are substrings of 2^n.
- Denominator(Sum_{i=1..n} 1/i^3)/denominator(Sum_{i=1..n} 1/i).A068589
Denominator(Sum_{i=1..n} 1/i^3)/denominator(Sum_{i=1..n} 1/i).
- Number of different Euler multigraphs with n edges, loops allowed.A068590
Number of different Euler multigraphs with n edges, loops allowed.
- Nonessential triangular numbers (conjectured).A068591
Nonessential triangular numbers (conjectured).
- Number of different Euler multigraphs with n edges, loops forbidden.A068592
Number of different Euler multigraphs with n edges, loops forbidden.
- Erroneous version of A007717.A068593
Erroneous version of A007717.
- Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A*B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}.A068594
Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A*B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}.
- Number of functions from {1,2,...,n} to {1,2,...,n} such that the sum of the function values is 0 mod 3.A068595
Number of functions from {1,2,...,n} to {1,2,...,n} such that the sum of the function values is 0 mod 3.
- Number of 4-ary Lyndon words whose trace and subtrace are both 0 mod 4.A068596
Number of 4-ary Lyndon words whose trace and subtrace are both 0 mod 4.
- Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.A068597
Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.
- Number of maximal sets of partitions of n with property that all parts in all partitions in the set are distinct.A068598
Number of maximal sets of partitions of n with property that all parts in all partitions in the set are distinct.
- Number of n-uniform tilings.A068599
Number of n-uniform tilings.
- Number of n-uniform tilings having n different arrangements of polygons about their vertices.A068600
Number of n-uniform tilings having n different arrangements of polygons about their vertices.
- a(n) = n^3 - 1.A068601
a(n) = n^3 - 1.
- Number of functions f:{0,1,2,...,n} -> {0,1,2,...,n} that satisfy f(0)=0 and f(n)=0, with f nowhere concave upward.A068602
Number of functions f:{0,1,2,...,n} -> {0,1,2,...,n} that satisfy f(0)=0 and f(n)=0, with f nowhere concave upward.
- Numbers n such that prime(n)+prime(2n)+prime(3n) is prime.A068603
Numbers n such that prime(n)+prime(2n)+prime(3n) is prime.
- Number of distinct coefficients in expansion related to enumeration of permutations of length n by length of longest subsequence.A068604
Number of distinct coefficients in expansion related to enumeration of permutations of length n by length of longest subsequence.
- Number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly two elements.A068605
Number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly two elements.
- Square table by antidiagonals of T(n,k)=n*k*(n+k+1).A068606
Square table by antidiagonals of T(n,k)=n*k*(n+k+1).
- Triangle of T(n,k)=n*k*(n+k+1) with n>=k>=0.A068607
Triangle of T(n,k)=n*k*(n+k+1) with n>=k>=0.
- Path of a knight's tour on an infinite chessboard.A068608
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068609
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068610
Path of a knight's tour on an infinite chessboard.