Sequences
392,541 sequences
- a(n)=number of Farey fractions of order n that are <=1/7; cf. A049805.A049811
a(n)=number of Farey fractions of order n that are <=1/7; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/8; cf. A049805.A049812
a(n)=number of Farey fractions of order n that are <=1/8; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/9; cf. A049805.A049813
a(n)=number of Farey fractions of order n that are <=1/9; cf. A049805.
- a(n)=number of Farey fractions of order n that are <=1/10; cf. A049805.A049814
a(n)=number of Farey fractions of order n that are <=1/10; cf. A049805.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049805.A049815
a(n) = Sum_{k=1..n} T(n,k), array T as in A049805.
- Triangular array T read by rows: T(n,k) = number of nonzero remainders when Euclidean algorithm acts on n and k, for k=1..n, n>=1.A049816
Triangular array T read by rows: T(n,k) = number of nonzero remainders when Euclidean algorithm acts on n and k, for k=1..n, n>=1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049816.A049817
a(n) = Sum_{k=1..n} T(n,k), array T as in A049816.
- a(n) = Sum_{k=1..n, m=1..n} T(m,k), array T as in A049816.A049818
a(n) = Sum_{k=1..n, m=1..n} T(m,k), array T as in A049816.
- a(n) = Max_{k=1..n} T(n,k), array T as in A049816.A049819
a(n) = Max_{k=1..n} T(n,k), array T as in A049816.
- a(n) = n - d(n), where d(n) is the number of divisors of n (A000005).A049820
a(n) = n - d(n), where d(n) is the number of divisors of n (A000005).
- a(n) = j + k, where u(n) = u(j) + u(k) is the unique sum of Ulam numbers described in A002859 (with 1 <= j < k < n).A049821
a(n) = j + k, where u(n) = u(j) + u(k) is the unique sum of Ulam numbers described in A002859 (with 1 <= j < k < n).
- a(n) = 1 - tau(n) + Sum_{d|n} tau(d-1).A049822
a(n) = 1 - tau(n) + Sum_{d|n} tau(d-1).
- a(n)=number of 2's in n-th row of array T given by A049816.A049823
a(n)=number of 2's in n-th row of array T given by A049816.
- a(n) = number of 3's in n-th row of array T given by A049816.A049824
a(n) = number of 3's in n-th row of array T given by A049816.
- a(n)=number of 4's in n-th row of array T given by A049816.A049825
a(n)=number of 4's in n-th row of array T given by A049816.
- a(n) = T(n,n) + T(n+1,n) + ... + T(2n-1,n) = sum over a period of n-th column of array T given by A049816.A049826
a(n) = T(n,n) + T(n+1,n) + ... + T(2n-1,n) = sum over a period of n-th column of array T given by A049816.
- a(n) = T(2n-1,n)+T(2n,n+1)+...+T(3n-3,2n-2) = sum over a period of n-th diagonal of array T given by A049816.A049827
a(n) = T(2n-1,n)+T(2n,n+1)+...+T(3n-3,2n-2) = sum over a period of n-th diagonal of array T given by A049816.
- Triangular array T given by rows: T(n,k)=sum of remainders when Euclidean algorithm acts on n,k; for k=1,2,...,n; n >= 1.A049828
Triangular array T given by rows: T(n,k)=sum of remainders when Euclidean algorithm acts on n,k; for k=1,2,...,n; n >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049828.A049829
a(n) = Sum_{k=1..n} T(n,k), array T as in A049828.
- a(n) = Sum_{k=1..n, m=1..k} T(m,k); array T as in A049828.A049830
a(n) = Sum_{k=1..n, m=1..k} T(m,k); array T as in A049828.
- a(n) = Max_{k=1..n} T(n,k), array T as in A049828.A049831
a(n) = Max_{k=1..n} T(n,k), array T as in A049828.
- a(n) = T(n,n) + T(n + 1,n) + ... + T(2n-1,n) = sum over a period of n-th column of array T given by A049828.A049832
a(n) = T(n,n) + T(n + 1,n) + ... + T(2n-1,n) = sum over a period of n-th column of array T given by A049828.
- a(n) = T(2n-1,n) + T(2n,n+1) + ... + T(3n-3,2n-2) = sum over a period of n-th diagonal of array T given by A049828.A049833
a(n) = T(2n-1,n) + T(2n,n+1) + ... + T(3n-3,2n-2) = sum over a period of n-th diagonal of array T given by A049828.
- Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...; also number of subtraction steps when computing gcd(n,k) using subtractions rather than divisions.A049834
Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...; also number of subtraction steps when computing gcd(n,k) using subtractions rather than divisions.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049834.A049835
a(n) = Sum_{k=1..n} T(n,k), array T as in A049834.
- a(n) = Sum_{m=1..n, k=1..m} T(m,k), array T as in A049834.A049836
a(n) = Sum_{m=1..n, k=1..m} T(m,k), array T as in A049834.
- Triangular array T read by rows: T(n,k)=number of distinct numbers that appear when Euclidean algorithm acts on n,k, for k=1,2,...,n; n=1,2,3,...A049837
Triangular array T read by rows: T(n,k)=number of distinct numbers that appear when Euclidean algorithm acts on n,k, for k=1,2,...,n; n=1,2,3,...
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049837.A049838
a(n) = Sum_{k=1..n} T(n,k), array T as in A049837.
- a(n) = Max_{k=1..n} T(n,k), array T as in A049837.A049839
a(n) = Max_{k=1..n} T(n,k), array T as in A049837.
- Triangular array T read by rows: T(n,k) = sum of numbers c in the form c = bq + r when Euclidean algorithm acts on n, k, for 1 <= k <= n, n >= 1.A049840
Triangular array T read by rows: T(n,k) = sum of numbers c in the form c = bq + r when Euclidean algorithm acts on n, k, for 1 <= k <= n, n >= 1.
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049840.A049841
a(n) = Sum_{k=1..n} T(n,k), array T as in A049840.
- a(n) = Max_{k=1..n} T(n,k), array T as in A049840.A049842
a(n) = Max_{k=1..n} T(n,k), array T as in A049840.
- Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes prime(n) and prime(k), k=1,2,...,n-1; n=2,3,4,...A049843
Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes prime(n) and prime(k), k=1,2,...,n-1; n=2,3,4,...
- a(n) = Sum_{k=1..n-1} T(n,k), array T as in A049843.A049844
a(n) = Sum_{k=1..n-1} T(n,k), array T as in A049843.
- a(n) = Sum_{m=2..n, k=1..m-1} T(m,k), array T as in A049843.A049845
a(n) = Sum_{m=2..n, k=1..m-1} T(m,k), array T as in A049843.
- a(n) = Max_{k=1..n-1} T(n,k), array T as in A049843.A049846
a(n) = Max_{k=1..n-1} T(n,k), array T as in A049843.
- a(n) = (2*n + 1 - prevprime(2*n+1))/2.A049847
a(n) = (2*n + 1 - prevprime(2*n+1))/2.
- a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 2 nonzero remainders.A049848
a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 2 nonzero remainders.
- a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 3 nonzero remainders.A049849
a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 3 nonzero remainders.
- a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders.A049850
a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders.
- Concatenate prevprime(n) and n.A049851
Concatenate prevprime(n) and n.
- Concatenate "n" and "nextprime(n)".A049852
Concatenate "n" and "nextprime(n)".
- a(n) = a(n-1) + Sum_{k=0..n-3} a(k) for n >= 2, a(0)=1, a(1)=2.A049853
a(n) = a(n-1) + Sum_{k=0..n-3} a(k) for n >= 2, a(0)=1, a(1)=2.
- a(n)=Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.A049854
a(n)=Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.
- a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.A049855
a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.
- a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1.A049856
a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1.
- Concatenate prevprime(n), n, and nextprime(n).A049857
Concatenate prevprime(n), n, and nextprime(n).
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,2.A049858
a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,2.
- a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=0, a(1)=1, a(2)=3.A049859
a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=0, a(1)=1, a(2)=3.
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,4.A049860
a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,4.