Sequences
392,541 sequences
- Product of gcd(k,n) for 1 <= k <= n.A067911
Product of gcd(k,n) for 1 <= k <= n.
- Engel expansion of zeta(4) = Pi^4/90 = Sum_{i>0} 1/i^4.A067912
Engel expansion of zeta(4) = Pi^4/90 = Sum_{i>0} 1/i^4.
- Engel expansion of Riemann zeta(5)=sum(i>0,1/i^5).A067913
Engel expansion of Riemann zeta(5)=sum(i>0,1/i^5).
- Engel expansion of zeta(6)=sum(i>0,1/i^6).A067914
Engel expansion of zeta(6)=sum(i>0,1/i^6).
- Engel expansion of zeta(7)=sum(i>0,1/i^7).A067915
Engel expansion of zeta(7)=sum(i>0,1/i^7).
- Engel expansion of zeta(8)=sum(i>0,1/i^8).A067916
Engel expansion of zeta(8)=sum(i>0,1/i^8).
- Engel expansion of zeta(9)=sum(i>0,1/i^9).A067917
Engel expansion of zeta(9)=sum(i>0,1/i^9).
- Engel expansion of zeta(10) = Sum_{i>0} 1/i^10.A067918
Engel expansion of zeta(10) = Sum_{i>0} 1/i^10.
- Engel expansion of sin(1).A067919
Engel expansion of sin(1).
- Engel expansion of sin(2).A067920
Engel expansion of sin(2).
- Engel expansion of sqrt(Pi/2).A067921
Engel expansion of sqrt(Pi/2).
- Engel expansion of log(5).A067922
Engel expansion of log(5).
- Engel expansion of log(23).A067923
Engel expansion of log(23).
- Triangle read by rows in which the n-th row gives degrees of irreducible representations of symmetric group S_n (cf. A060240) but now rows are sorted as indicated in A059797 with p(n) terms on each row, where p(n) = A000041(n).A067924
Triangle read by rows in which the n-th row gives degrees of irreducible representations of symmetric group S_n (cf. A060240) but now rows are sorted as indicated in A059797 with p(n) terms on each row, where p(n) = A000041(n).
- Consider a room of size r X s where rs = 2n and 1 <= r, 1 <= s; count ways to arrange n Tatami mats in room; a(n) = total number of ways for all choices of r and s. Two arrangements are distinguished if one is a rotation or reflection of the other.A067925
Consider a room of size r X s where rs = 2n and 1 <= r, 1 <= s; count ways to arrange n Tatami mats in room; a(n) = total number of ways for all choices of r and s. Two arrangements are distinguished if one is a rotation or reflection of the other.
- a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).A067926
a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).
- Duplicate of A038546.A067927
Duplicate of A038546.
- Numbers k such that the digits of the k-th prime begin with k.A067928
Numbers k such that the digits of the k-th prime begin with k.
- Numbers k that divide the alternating sum phi(1) - phi(2) + phi(3) - phi(4) + ... + ((-1)^(k+1))*phi(k).A067929
Numbers k that divide the alternating sum phi(1) - phi(2) + phi(3) - phi(4) + ... + ((-1)^(k+1))*phi(k).
- Nonprime solutions to k == -1 (mod phi(k+1)).A067930
Nonprime solutions to k == -1 (mod phi(k+1)).
- Numbers k that divide the alternating sum sigma(1) - sigma(2) + sigma(3) - sigma(4) + ... + ((-1)^(k+1))*sigma(k).A067931
Numbers k that divide the alternating sum sigma(1) - sigma(2) + sigma(3) - sigma(4) + ... + ((-1)^(k+1))*sigma(k).
- Primes p such that p+3 == 0 (mod phi(p+3)).A067932
Primes p such that p+3 == 0 (mod phi(p+3)).
- Primes p such that p == -1 (mod phi(p-1)).A067933
Primes p such that p == -1 (mod phi(p-1)).
- Let rep(k) = (10^k - 1)/9 be the k-th repunit number = 11111..1111 with k 1 digits, then sequence gives values of k such that rep(k) == 1 (mod k).A067934
Let rep(k) = (10^k - 1)/9 be the k-th repunit number = 11111..1111 with k 1 digits, then sequence gives values of k such that rep(k) == 1 (mod k).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n).A067935
Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n).A067936
Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n).
- Let rep(k) be the k-th repunit number, sequence gives values of k such that rep(k) == rep(4) (mod k).A067937
Let rep(k) be the k-th repunit number, sequence gives values of k such that rep(k) == rep(4) (mod k).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(5) (mod n).A067938
Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(5) (mod n).
- Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(6) (mod n).A067939
Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(6) (mod n).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(7) (mod n).A067940
Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(7) (mod n).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(8) (mod n).A067941
Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(8) (mod n).
- Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(9) (mod n).A067942
Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(9) (mod n).
- Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(10) (mod n).A067943
Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(10) (mod n).
- Integers of the form (rep(n)-1)/n where rep(n)=1111111111...111 with n 1's is the n-th repunit number.A067944
Integers of the form (rep(n)-1)/n where rep(n)=1111111111...111 with n 1's is the n-th repunit number.
- Numbers k that divide 3^k - 1.A067945
Numbers k that divide 3^k - 1.
- Numbers k that divide 5^k - 1.A067946
Numbers k that divide 5^k - 1.
- Numbers k such that k divides 7^k - 1.A067947
Numbers k such that k divides 7^k - 1.
- Triangle of labeled rooted trees according to the number of increasing edges.A067948
Triangle of labeled rooted trees according to the number of increasing edges.
- Smallest primes not generated by Buss's function up to n=603 (see A067836).A067949
Smallest primes not generated by Buss's function up to n=603 (see A067836).
- a(n) = number of 3-times (but not 4-times) reformable permutation of {1,...,n}.A067950
a(n) = number of 3-times (but not 4-times) reformable permutation of {1,...,n}.
- a(0) = 1; a(n) = Sum_{1 <= k <= n and k|n} a(n-k).A067951
a(0) = 1; a(n) = Sum_{1 <= k <= n and k|n} a(n-k).
- Numbers k having a partition k = sum x_i for which sum k/x_i is also a partition of k and the x_i are distinct parts.A067952
Numbers k having a partition k = sum x_i for which sum k/x_i is also a partition of k and the x_i are distinct parts.
- Number of ways to sum numbers from 1 to n to the n-th prime.A067953
Number of ways to sum numbers from 1 to n to the n-th prime.
- Primes related to the nondecreasing subsequence of A007605 (sums of digits of primes).A067954
Primes related to the nondecreasing subsequence of A007605 (sums of digits of primes).
- Number of dissections of a convex polygon by nonintersecting diagonals into polygons with even number of sides and having a total number of n edges (sides and diagonals).A067955
Number of dissections of a convex polygon by nonintersecting diagonals into polygons with even number of sides and having a total number of n edges (sides and diagonals).
- Number of nodes in virtual, "optimal", chordal graphs of diameter 4 and degree n+1.A067956
Number of nodes in virtual, "optimal", chordal graphs of diameter 4 and degree n+1.
- Number of divisor chains of length n: permutations s_1,s_2,...,s_n of 1,2,...,n such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.A067957
Number of divisor chains of length n: permutations s_1,s_2,...,s_n of 1,2,...,n such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.
- Number of binary arrangements without adjacent 1's on n X n torus connected e-w ne-sw n-s nw-se.A067958
Number of binary arrangements without adjacent 1's on n X n torus connected e-w ne-sw n-s nw-se.
- Number of binary arrangements without adjacent 1's on n X n torus connected ne-sw n-s nw-se.A067959
Number of binary arrangements without adjacent 1's on n X n torus connected ne-sw n-s nw-se.
- Number of binary arrangements without adjacent 1's on n X n torus connected ne-sw nw-se.A067960
Number of binary arrangements without adjacent 1's on n X n torus connected ne-sw nw-se.