Sequences
392,541 sequences
- Triangle read by rows: T(n,k) = A002110(n)/prime(n+1-k), k = 1..n.A077011
Triangle read by rows: T(n,k) = A002110(n)/prime(n+1-k), k = 1..n.
- Triangle in which n-th row contains all possible products of n-1 of the first n natural numbers in ascending order.A077012
Triangle in which n-th row contains all possible products of n-1 of the first n natural numbers in ascending order.
- Number of different argument values of vector sums generated by n vectors chosen from 2n (equally spaced) points around the unit circle. Arguments are considered different only up to rotation and reflection.A077013
Number of different argument values of vector sums generated by n vectors chosen from 2n (equally spaced) points around the unit circle. Arguments are considered different only up to rotation and reflection.
- Number of ways that a directed line (or river) that starts in the south can cross an east-west road n times.A077014
Number of ways that a directed line (or river) that starts in the south can cross an east-west road n times.
- a(1) = 1, continue by multiplying by the smallest composite number and then dividing by the smallest prime not used earlier and taking the integer part at every step.A077015
a(1) = 1, continue by multiplying by the smallest composite number and then dividing by the smallest prime not used earlier and taking the integer part at every step.
- a(1) = 1, a(2) = 4, continue by dividing by the smallest prime not used earlier and multiplying with the smallest composite number just greater than the previous prime used in the division and then take the integer part at every step.A077016
a(1) = 1, a(2) = 4, continue by dividing by the smallest prime not used earlier and multiplying with the smallest composite number just greater than the previous prime used in the division and then take the integer part at every step.
- a(1) = 2, a(n+1) = smallest positive integer divisible by the n-th prime that also has a nontrivial common divisor with a(n).A077017
a(1) = 2, a(n+1) = smallest positive integer divisible by the n-th prime that also has a nontrivial common divisor with a(n).
- Closest prime to n (break ties by taking the larger prime).A077018
Closest prime to n (break ties by taking the larger prime).
- a(n) is the smallest number for which the prime distance A051699 is equal to n.A077019
a(n) is the smallest number for which the prime distance A051699 is equal to n.
- a(n) is the unique odd positive solution x of 2^n = 7x^2+y^2.A077020
a(n) is the unique odd positive solution x of 2^n = 7x^2+y^2.
- a(n) is the unique odd positive solution y of 2^n = 7x^2 + y^2.A077021
a(n) is the unique odd positive solution y of 2^n = 7x^2 + y^2.
- Values of k such that sum of first k primes squared is divisible by k-th prime.A077022
Values of k such that sum of first k primes squared is divisible by k-th prime.
- Integer values of sum of first k primes squared divided by k-th prime, for some k (A077022).A077023
Integer values of sum of first k primes squared divided by k-th prime, for some k (A077022).
- a(n) = Sum_{k=1..n} floor(n/k + 1/2).A077024
a(n) = Sum_{k=1..n} floor(n/k + 1/2).
- a(n) = Sum_{k=1..n} floor(n/(k + 1/2)).A077025
a(n) = Sum_{k=1..n} floor(n/(k + 1/2)).
- a(n) = Sum_{k=1..n} floor(n/k + 1)-floor(n/k + 1/2).A077026
a(n) = Sum_{k=1..n} floor(n/k + 1)-floor(n/k + 1/2).
- Number of simple integral graphs on n nodes.A077027
Number of simple integral graphs on n nodes.
- The rascal triangle, read by rows: T(n,k) (n >= 0, 0 <= k <= n) = k(n-k) + 1.A077028
The rascal triangle, read by rows: T(n,k) (n >= 0, 0 <= k <= n) = k(n-k) + 1.
- Rectangle R(i,j) read by ascending antidiagonals: column j has j-1 zeros followed by numbers congruent to 1 mod j-1.A077029
Rectangle R(i,j) read by ascending antidiagonals: column j has j-1 zeros followed by numbers congruent to 1 mod j-1.
- Numbers k such that A068340(k)=+/-2.A077030
Numbers k such that A068340(k)=+/-2.
- Numbers k such that A068340(k)=+/-3.A077031
Numbers k such that A068340(k)=+/-3.
- Numbers k such that A068340(k)=+/-4.A077032
Numbers k such that A068340(k)=+/-4.
- Numbers k such that A068340(k) = +/-5.A077033
Numbers k such that A068340(k) = +/-5.
- a(1)=3; a(2n), a(2n+1) are smallest integers > a(2n-1) such that a(2n-1)^2+a(2n)^2=a(2n+1)^2.A077034
a(1)=3; a(2n), a(2n+1) are smallest integers > a(2n-1) such that a(2n-1)^2+a(2n)^2=a(2n+1)^2.
- a(1)=7; a(n),a(n+1) are smallest > a(n-1) such that a(n-1)^2+a(n)^2=a(n+1)^2.A077035
a(1)=7; a(n),a(n+1) are smallest > a(n-1) such that a(n-1)^2+a(n)^2=a(n+1)^2.
- Duplicate of A076604.A077036
Duplicate of A076604.
- Largest prime < n^3.A077037
Largest prime < n^3.
- Least difference of primes p, q such that p < n^3 < q.A077038
Least difference of primes p, q such that p < n^3 < q.
- Partial sums of A073579.A077039
Partial sums of A073579.
- Primes p such that abs(A077039(A049084(p))) <= p.A077040
Primes p such that abs(A077039(A049084(p))) <= p.
- Primes p such that abs(A077039(A049084(p))) > p.A077041
Primes p such that abs(A077039(A049084(p))) > p.
- Square array read by falling antidiagonals of central polynomial coefficients: largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^k = ((1-x^n)/(1-x))^k, i.e., the coefficient of x^floor(k*(n-1)/2) and of x^ceiling(k*(n-1)/2); also number of compositions of floor(k*(n+1)/2) into exactly k positive integers each no more than n.A077042
Square array read by falling antidiagonals of central polynomial coefficients: largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^k = ((1-x^n)/(1-x))^k, i.e., the coefficient of x^floor(k*(n-1)/2) and of x^ceiling(k*(n-1)/2); also number of compositions of floor(k*(n+1)/2) into exactly k positive integers each no more than n.
- "Three-quarter squares": a(n) = n^2 - A002620(n).A077043
"Three-quarter squares": a(n) = n^2 - A002620(n).
- Largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^5 = ((1-x^n)/(1-x))^5, i.e., the coefficient of x^floor(5*(n-1)/2) and of x^ceiling(5*(n-1)/2); also number of compositions of floor(5*(n+1)/2) into exactly 5 positive integers each no more than n.A077044
Largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^5 = ((1-x^n)/(1-x))^5, i.e., the coefficient of x^floor(5*(n-1)/2) and of x^ceiling(5*(n-1)/2); also number of compositions of floor(5*(n+1)/2) into exactly 5 positive integers each no more than n.
- Doubly restricted composition numbers: number of compositions of 1+2+3+...+n = n(n+1)/2 into exactly n positive integers each no more than n.A077045
Doubly restricted composition numbers: number of compositions of 1+2+3+...+n = n(n+1)/2 into exactly n positive integers each no more than n.
- Doubly restricted composition numbers: number of compositions of [n^2/2] into exactly n positive integers each strictly less than n.A077046
Doubly restricted composition numbers: number of compositions of [n^2/2] into exactly n positive integers each strictly less than n.
- Doubly restricted composition numbers: number of compositions of floor(n(n+2)/2) into exactly n positive integers each no more than n+1.A077047
Doubly restricted composition numbers: number of compositions of floor(n(n+2)/2) into exactly n positive integers each no more than n+1.
- Doubly restricted composition numbers: number of compositions of [n^2/2] into up to n positive integers each no more than n.A077048
Doubly restricted composition numbers: number of compositions of [n^2/2] into up to n positive integers each no more than n.
- Left summatory matrix, T, by antidiagonals upwards.A077049
Left summatory matrix, T, by antidiagonals upwards.
- Left Moebius transformation matrix, M, by antidiagonals.A077050
Left Moebius transformation matrix, M, by antidiagonals.
- Right summatory matrix, T, by antidiagonals.A077051
Right summatory matrix, T, by antidiagonals.
- Right Moebius transformation matrix, M, by antidiagonals.A077052
Right Moebius transformation matrix, M, by antidiagonals.
- Greatest common divisor of indecomposable Wallis pairs.A077053
Greatest common divisor of indecomposable Wallis pairs.
- Number of ways a river can cross a road 2n times.A077054
Number of ways a river can cross a road 2n times.
- Call two meanders from A005316 equivalent if they differ by a reflection in the Y axis (if n even) or by reflections in the X or Y axes (if n odd). Sequence gives number of inequivalent meanders with n crossings.A077055
Call two meanders from A005316 equivalent if they differ by a reflection in the Y axis (if n even) or by reflections in the X or Y axes (if n odd). Sequence gives number of inequivalent meanders with n crossings.
- Total number of "humps" in all A005316(2n) open meanders with 2n crossings.A077056
Total number of "humps" in all A005316(2n) open meanders with 2n crossings.
- Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)*b(n) - G(n)*b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).A077057
Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)*b(n) - G(n)*b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).
- Minimal positive solution a(n) of Diophantine equation b(n)^2 - b(n)*a(n) - G(n)*a(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077057(n).A077058
Minimal positive solution a(n) of Diophantine equation b(n)^2 - b(n)*a(n) - G(n)*a(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077057(n).
- Numbers j such that j^2 + k^2 is a cube for some k > j.A077059
Numbers j such that j^2 + k^2 is a cube for some k > j.
- Smallest k>A077059(n) such that A077059(n)^2+k^2 is a cube (=A077061(n)^3).A077060
Smallest k>A077059(n) such that A077059(n)^2+k^2 is a cube (=A077061(n)^3).