Sequences
392,541 sequences
- Triangular array T, read by rows: T(n,k) = n^3 mod k, for k = 1..n and n >= 1.A049761
Triangular array T, read by rows: T(n,k) = n^3 mod k, for k = 1..n and n >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049761.A049762
a(n) = Sum_{k=1..n} T(n,k), array T as in A049761.
- Triangular array T, read by rows: T(n,k) = n^4 mod k, for k = 1..n and n >= 1.A049763
Triangular array T, read by rows: T(n,k) = n^4 mod k, for k = 1..n and n >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049763.A049764
a(n) = Sum_{k=1..n} T(n,k), array T as in A049763.
- Triangular array T, read by rows: T(n,k) = (k mod n) + (n mod k), for k = 1..n and n >= 1.A049765
Triangular array T, read by rows: T(n,k) = (k mod n) + (n mod k), for k = 1..n and n >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049765.A049766
a(n) = Sum_{k=1..n} T(n,k), array T as in A049765.
- Triangular array T, read by rows: T(n,k) = (k^2 mod n) + (n^2 mod k), for k = 1..n and n >= 1.A049767
Triangular array T, read by rows: T(n,k) = (k^2 mod n) + (n^2 mod k), for k = 1..n and n >= 1.
- a(n) = Sum_{k = 1..n} T(n,k), where array T is A049767.A049768
a(n) = Sum_{k = 1..n} T(n,k), where array T is A049767.
- Triangular array T read by rows: T(n,k) = (k^3 mod n) + (n^3 mod k).A049769
Triangular array T read by rows: T(n,k) = (k^3 mod n) + (n^3 mod k).
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049769.A049770
a(n) = Sum_{k=1..n} T(n,k), array T as in A049769.
- Triangular array T read by rows: T(n,k) = (k^4 mod n) + (n^4 mod k).A049771
Triangular array T read by rows: T(n,k) = (k^4 mod n) + (n^4 mod k).
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049771.A049772
a(n) = Sum_{k=1..n} T(n,k), array T as in A049771.
- Triangular array T read by rows: if row n is r(1),...,r(m), then row n+1 is 2r(1)-1,...,2r(m)-1,2r(1),...,2r(m).A049773
Triangular array T read by rows: if row n is r(1),...,r(m), then row n+1 is 2r(1)-1,...,2r(m)-1,2r(1),...,2r(m).
- Number of permutations of n elements not containing the consecutive pattern 123.A049774
Number of permutations of n elements not containing the consecutive pattern 123.
- a(n) is the sum of all integers from 2^(n-2)+1 to 2^(n-1).A049775
a(n) is the sum of all integers from 2^(n-2)+1 to 2^(n-1).
- Triangular array T read by rows: n-th row consists of fixed points, k, of n-th row of array t given by A049773; i.e., t(n, t(n,k)) = t(n,k).A049776
Triangular array T read by rows: n-th row consists of fixed points, k, of n-th row of array t given by A049773; i.e., t(n, t(n,k)) = t(n,k).
- Triangular array read by rows: T(m,n) = n + n+1 + ... + m = (m+n)(m-n+1)/2.A049777
Triangular array read by rows: T(m,n) = n + n+1 + ... + m = (m+n)(m-n+1)/2.
- a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.A049778
a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.A049779
a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.
- Array T, read by descending antidiagonals: T(n, k) = k*(2*n + k + 1)/2 for n, k >= 0.A049780
Array T, read by descending antidiagonals: T(n, k) = k*(2*n + k + 1)/2 for n, k >= 0.
- a(n) = (b(n) + 1)/2, where b = A000959 (the lucky numbers).A049781
a(n) = (b(n) + 1)/2, where b = A000959 (the lucky numbers).
- a(n) = (0! + 1! + ... + (n-1)!) mod n.A049782
a(n) = (0! + 1! + ... + (n-1)!) mod n.
- Triangular array T read by rows: T(n,k) = Sum_{j=1..k} (n mod floor(k/j)) for n, k >= 1.A049783
Triangular array T read by rows: T(n,k) = Sum_{j=1..k} (n mod floor(k/j)) for n, k >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049783.A049784
a(n) = Sum_{k=1..n} T(n,k), array T as in A049783.
- a(n) = Sum_{k=1..n} (n mod floor(n/k)) = T(n,n), array T as in A049783.A049785
a(n) = Sum_{k=1..n} (n mod floor(n/k)) = T(n,n), array T as in A049783.
- a(n) = T(n,n-1), array T as in A049783.A049786
a(n) = T(n,n-1), array T as in A049783.
- a(n) = T(n,n-2), array T as in A049783.A049787
a(n) = T(n,n-2), array T as in A049783.
- a(n) = T(n,n-3), array T as in A049783.A049788
a(n) = T(n,n-3), array T as in A049783.
- a(n) = T(n,n-4), array T as in A049783.A049789
a(n) = T(n,n-4), array T as in A049783.
- Triangular array T read by rows: T(n,k) = Sum_{j=1..k} floor(n/floor(k/j)).A049790
Triangular array T read by rows: T(n,k) = Sum_{j=1..k} floor(n/floor(k/j)).
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.A049791
a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.
- a(n) = Sum_{k=1..n} floor(n/floor(n/k)).A049792
a(n) = Sum_{k=1..n} floor(n/floor(n/k)).
- a(n) = T(n,n-1), array T as in A049790.A049793
a(n) = T(n,n-1), array T as in A049790.
- a(n) = T(n,n-2), array T as in A049790.A049794
a(n) = T(n,n-2), array T as in A049790.
- a(n) = T(n,n-3), array T as in A049790.A049795
a(n) = T(n,n-3), array T as in A049790.
- a(n) = T(n,n-4), array T as in A049790.A049796
a(n) = T(n,n-4), array T as in A049790.
- a(n) = Sum_{k = 2..n} T(n,k), array T as in A049800.A049797
a(n) = Sum_{k = 2..n} T(n,k), array T as in A049800.
- a(n) = (1/2)*Sum_{k = 1..n} T(n,k), array T as in A049800.A049798
a(n) = (1/2)*Sum_{k = 1..n} T(n,k), array T as in A049800.
- a(n) = Sum_{k = 3..n} T(n,k), where the array T is A049801.A049799
a(n) = Sum_{k = 3..n} T(n,k), where the array T is A049801.
- Triangular array T, read by rows: T(n,k) = (n+1) mod floor((k+1)/2), k = 1..n and n >= 1.A049800
Triangular array T, read by rows: T(n,k) = (n+1) mod floor((k+1)/2), k = 1..n and n >= 1.
- Triangular array T, read by rows: T(n,k) = n mod floor(k/3), k = 3..n and n >= 3.A049801
Triangular array T, read by rows: T(n,k) = n mod floor(k/3), k = 3..n and n >= 3.
- a(n) = n mod 2 + n mod 4 + ... + n mod 2^k, where 2^k <= n < 2^(k+1).A049802
a(n) = n mod 2 + n mod 4 + ... + n mod 2^k, where 2^k <= n < 2^(k+1).
- a(n) = n mod 3 + n mod 9 + ... + n mod 3^k, where 3^k <= n < 3^(k+1).A049803
a(n) = n mod 3 + n mod 9 + ... + n mod 3^k, where 3^k <= n < 3^(k+1).
- a(n) = n mod 4 + n mod 16 + ... + n mod 4^k, where 4^k <= n < 4^(k+1).A049804
a(n) = n mod 4 + n mod 16 + ... + n mod 4^k, where 4^k <= n < 4^(k+1).
- Triangular array T read by rows: T(n,k) is the number of Farey fractions of order n that are <= 1/k for k=1..n, for n>=1.A049805
Triangular array T read by rows: T(n,k) is the number of Farey fractions of order n that are <= 1/k for k=1..n, for n>=1.
- Number of Farey fractions of order n that are <=1/2; cf. A049805.A049806
Number of Farey fractions of order n that are <=1/2; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/3; cf. A049805.A049807
a(n)=number of Farey fractions of order n that are <=1/3; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/4; cf. A049805.A049808
a(n)=number of Farey fractions of order n that are <=1/4; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/5; cf. A049805.A049809
a(n)=number of Farey fractions of order n that are <=1/5; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/6; cf. A049805.A049810
a(n)=number of Farey fractions of order n that are <=1/6; cf. A049805.