Sequences
392,541 sequences
- a(n) = 4^n + 5^n.A074611
a(n) = 4^n + 5^n.
- a(n) = 4^n + 6^n.A074612
a(n) = 4^n + 6^n.
- a(n) = 4^n + 7^n.A074613
a(n) = 4^n + 7^n.
- a(n) = 4^n + 9^n.A074614
a(n) = 4^n + 9^n.
- a(n) = 5^n + 6^n.A074615
a(n) = 5^n + 6^n.
- a(n) = 5^n + 7^n.A074616
a(n) = 5^n + 7^n.
- a(n) = 5^n + 8^n.A074617
a(n) = 5^n + 8^n.
- a(n) = 5^n + 9^n.A074618
a(n) = 5^n + 9^n.
- a(n) = 6^n + 7^n.A074619
a(n) = 6^n + 7^n.
- a(n) = 6^n + 8^n.A074620
a(n) = 6^n + 8^n.
- a(n) = 6^n + 9^n.A074621
a(n) = 6^n + 9^n.
- a(n) = 7^n + 8^n.A074622
a(n) = 7^n + 8^n.
- a(n) = 7^n + 9^n.A074623
a(n) = 7^n + 9^n.
- a(n) = 8^n + 9^n.A074624
a(n) = 8^n + 9^n.
- Triangular array T(n,k) (n >= 1, 1 <= k <= n) read by rows, where T(n,k) = smallest number x such that Mod[sigma[x],n]=k.A074625
Triangular array T(n,k) (n >= 1, 1 <= k <= n) read by rows, where T(n,k) = smallest number x such that Mod[sigma[x],n]=k.
- Prime following the n-th Mersenne prime.A074626
Prime following the n-th Mersenne prime.
- Numbers n such that sigma(n) is divisible by 6.A074627
Numbers n such that sigma(n) is divisible by 6.
- Numbers k such that sigma(k) == 2 mod 6.A074628
Numbers k such that sigma(k) == 2 mod 6.
- Duplicate of A067051.A074629
Duplicate of A067051.
- Numbers k such that sigma(k) == 4 mod 6.A074630
Numbers k such that sigma(k) == 4 mod 6.
- a(n) is the smallest k such that the sum of the first k terms of the composite-harmonic series, Sum_{j=1..k} 1/(j-th composite), is > n.A074631
a(n) is the smallest k such that the sum of the first k terms of the composite-harmonic series, Sum_{j=1..k} 1/(j-th composite), is > n.
- Numbers k such that the sum of 2nd, 3rd, 4th and 5th powers of divisors of k are divisible by sum of divisors of k.A074632
Numbers k such that the sum of 2nd, 3rd, 4th and 5th powers of divisors of k are divisible by sum of divisors of k.
- a(n) is the smallest index m such that Sum_{k=2..m} 1/PrimePi(k) >= n, where PrimePi()=A000720().A074633
a(n) is the smallest index m such that Sum_{k=2..m} 1/PrimePi(k) >= n, where PrimePi()=A000720().
- Cototient-remainder triangle: triangular array T(n,k) (n >= 1, 0 <= k < n) read by rows, where T(n,k) = smallest number x such that cototient(x) mod n = k.A074634
Cototient-remainder triangle: triangular array T(n,k) (n >= 1, 0 <= k < n) read by rows, where T(n,k) = smallest number x such that cototient(x) mod n = k.
- a(0)=1, a(n) = Sum_{k=0..n} (binomial(n,k)^2 * binomial(n+k,k+1)^2)/n^2.A074635
a(0)=1, a(n) = Sum_{k=0..n} (binomial(n,k)^2 * binomial(n+k,k+1)^2)/n^2.
- Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-floor(k/b(k)). Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.A074636
Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-floor(k/b(k)). Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.
- Numerator of 4 * H(n,4,3), a generalized harmonic number.A074637
Numerator of 4 * H(n,4,3), a generalized harmonic number.
- Denominator of 1/3 + 1/7 + 1/11 + ... + 1/(4n-1).A074638
Denominator of 1/3 + 1/7 + 1/11 + ... + 1/(4n-1).
- a(n)=Sum_h (hh'-1)/n with h and h' in [1,n], (h,n)=1, hh'=1 (mod n).A074639
a(n)=Sum_h (hh'-1)/n with h and h' in [1,n], (h,n)=1, hh'=1 (mod n).
- a(n) = A074639(n) mod A000010(n).A074640
a(n) = A074639(n) mod A000010(n).
- a(n) = gcd(A074639(n), A000010(n)).A074641
a(n) = gcd(A074639(n), A000010(n)).
- Numerator of A074639(n)/A000010(n).A074642
Numerator of A074639(n)/A000010(n).
- Denominator of A074639(n)/A000010(n).A074643
Denominator of A074639(n)/A000010(n).
- a(n) = (A074639(n^2) - A074639(n)) mod n.A074644
a(n) = (A074639(n^2) - A074639(n)) mod n.
- Numbers k such that A000010(k) divides A074639(k).A074645
Numbers k such that A000010(k) divides A074639(k).
- a(n) = A074639(A074645(n)).A074646
a(n) = A074639(A074645(n)).
- Numbers k such that A074639(k) and A000010(k) are coprime.A074647
Numbers k such that A074639(k) and A000010(k) are coprime.
- a(n)=A074639(A074647(n)).A074648
a(n)=A074639(A074647(n)).
- a(0) = 1; for n >= 1, a(n) = sum(binomial(n,k)^3*binomial(n+k,k+1)^2,k = 0..n)/n^2.A074649
a(0) = 1; for n >= 1, a(n) = sum(binomial(n,k)^3*binomial(n+k,k+1)^2,k = 0..n)/n^2.
- Table T(n,k) read by downward antidiagonals: number of Lyndon words (aperiodic necklaces) with n beads of k colors, n >= 1, k >= 1.A074650
Table T(n,k) read by downward antidiagonals: number of Lyndon words (aperiodic necklaces) with n beads of k colors, n >= 1, k >= 1.
- (1/n) * sum over d|n of {mu(n/d) * (3d)! / d!^3}.A074651
(1/n) * sum over d|n of {mu(n/d) * (3d)! / d!^3}.
- 1/n * sum over d|n of {mu(n/d) * (4d)! / d!^4}.A074652
1/n * sum over d|n of {mu(n/d) * (4d)! / d!^4}.
- 1/n * sum over d|n of {mu(n/d) * (5d)! / d!^5}.A074653
1/n * sum over d|n of {mu(n/d) * (5d)! / d!^5}.
- Number of Lyndon words (aperiodic necklaces) with 5n beads of 5 colors, n beads of each color. One color labeled, the other 4 unlabeled.A074654
Number of Lyndon words (aperiodic necklaces) with 5n beads of 5 colors, n beads of each color. One color labeled, the other 4 unlabeled.
- Number of Lyndon words (aperiodic necklaces) with 3n beads of 3 colors, n beads of each color.A074655
Number of Lyndon words (aperiodic necklaces) with 3n beads of 3 colors, n beads of each color.
- Number of Lyndon words (aperiodic necklaces) with 4n beads of 4 colors, n beads of each color.A074656
Number of Lyndon words (aperiodic necklaces) with 4n beads of 4 colors, n beads of each color.
- Number of Lyndon words (aperiodic necklaces) with 5n beads of 5 colors, n beads of each color.A074657
Number of Lyndon words (aperiodic necklaces) with 5n beads of 5 colors, n beads of each color.
- Number of 'convex' partitions of n; i.e., partitions of n for which the Ferrers graph is the intersection of a convex set and the integer lattice.A074658
Number of 'convex' partitions of n; i.e., partitions of n for which the Ferrers graph is the intersection of a convex set and the integer lattice.
- First differences of A074658, which counts the convex partitions of n.A074659
First differences of A074658, which counts the convex partitions of n.
- Second differences of A074658, which counts the convex partitions of n.A074660
Second differences of A074658, which counts the convex partitions of n.