Sequences
392,541 sequences
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if 0<=i-j<=2 else m(i,j)=1.A080061
Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if 0<=i-j<=2 else m(i,j)=1.
- Composite numbers n such that for all primes p dividing n, p-1 divides n-1.A080062
Composite numbers n such that for all primes p dividing n, p-1 divides n-1.
- a(n) = n mod (spf(n)+1), where spf(n) is the smallest prime dividing n (A020639).A080063
a(n) = n mod (spf(n)+1), where spf(n) is the smallest prime dividing n (A020639).
- Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).A080064
Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).
- Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).A080065
Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).
- First differences of A000966 (number of zeros that n! will never end in).A080066
First differences of A000966 (number of zeros that n! will never end in).
- a(n) = A057163(A057548(A057164(n))).A080067
a(n) = A057163(A057548(A057164(n))).
- Iterates of A080067.A080068
Iterates of A080067.
- a(n) = A014486(A080068(n)).A080069
a(n) = A014486(A080068(n)).
- Decimal encoding of parenthesizations produced by simple iteration starting from empty parentheses and where each successive parenthesization is obtained from the previous by reflecting it as a general tree/parenthesization, then adding an extra stem below the root and then reflecting the underlying binary tree.A080070
Decimal encoding of parenthesizations produced by simple iteration starting from empty parentheses and where each successive parenthesization is obtained from the previous by reflecting it as a general tree/parenthesization, then adding an extra stem below the root and then reflecting the underlying binary tree.
- Top-level length of each parenthesization/root degree of general trees encoded in A080070.A080071
Top-level length of each parenthesization/root degree of general trees encoded in A080070.
- Values of n such that Pi^n is farther from its closest integer than any Pi^k for 1 <= k < n.A080072
Values of n such that Pi^n is farther from its closest integer than any Pi^k for 1 <= k < n.
- The exponential generating function A(x) = Sum a(j) x^j/j! satisfies the functional equation A(x)=1+x*(A(x))*(1-log(A(x))).A080073
The exponential generating function A(x) = Sum a(j) x^j/j! satisfies the functional equation A(x)=1+x*(A(x))*(1-log(A(x))).
- a(n) = round(126*phi^n).A080074
a(n) = round(126*phi^n).
- Proth numbers: of the form k*2^m + 1 for k odd, m >= 1 and 2^m > k.A080075
Proth numbers: of the form k*2^m + 1 for k odd, m >= 1 and 2^m > k.
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.A080076
Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.
- Smallest prime p such that between p and the next prime for every k = 1, ..., n there is a number m_k whose smallest prime factor is prime(k).A080077
Smallest prime p such that between p and the next prime for every k = 1, ..., n there is a number m_k whose smallest prime factor is prime(k).
- Union of A080105 and A080106.A080078
Union of A080105 and A080106.
- Least number causing the longest carry sequence when adding numbers <= n to n in binary representation.A080079
Least number causing the longest carry sequence when adding numbers <= n to n in binary representation.
- T(n,k) = length of longest carry sequence when adding k to n in binary representation, 1 <= k <= n (triangular array).A080080
T(n,k) = length of longest carry sequence when adding k to n in binary representation, 1 <= k <= n (triangular array).
- Beatty sequence for (3+sqrt(13))/2.A080081
Beatty sequence for (3+sqrt(13))/2.
- Smallest prime p such that there is a gap of exactly 2*prime(n) between p and the next prime.A080082
Smallest prime p such that there is a gap of exactly 2*prime(n) between p and the next prime.
- Smallest prime p such that there is a gap of 2*prime(n) between p and previous prime.A080083
Smallest prime p such that there is a gap of 2*prime(n) between p and previous prime.
- Number of prime factors in the factorial of the n-th prime, counted with multiplicity.A080084
Number of prime factors in the factorial of the n-th prime, counted with multiplicity.
- Number of factors of 2 in the factorial of the n-th prime, counted with multiplicity.A080085
Number of factors of 2 in the factorial of the n-th prime, counted with multiplicity.
- Number of factors of 3 in the factorial of the n-th prime, counted with multiplicity.A080086
Number of factors of 3 in the factorial of the n-th prime, counted with multiplicity.
- Number of factors of 5 in the factorial of the n-th prime, counted with multiplicity.A080087
Number of factors of 5 in the factorial of the n-th prime, counted with multiplicity.
- Let r+i*s be the sum of the first-quadrant Gaussian primes dividing prime(n); sequence gives r values.A080088
Let r+i*s be the sum of the first-quadrant Gaussian primes dividing prime(n); sequence gives r values.
- Let r+i*s be the sum of the first-quadrant Gaussian primes dividing prime(n); sequence gives s values.A080089
Let r+i*s be the sum of the first-quadrant Gaussian primes dividing prime(n); sequence gives s values.
- a(n) is the index of the first occurrence of n in A080071, or 0 for those n>0 which never occur in A080071.A080090
a(n) is the index of the first occurrence of n in A080071, or 0 for those n>0 which never occur in A080071.
- Duplicate of A000602.A080091
Duplicate of A000602.
- Irregular triangle read by rows, giving prime sequences (p-1|2n) appearing in the n-th von Staudt-Clausen sum.A080092
Irregular triangle read by rows, giving prime sequences (p-1|2n) appearing in the n-th von Staudt-Clausen sum.
- Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=x(n).A080093
Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=x(n).
- Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=y(n).A080094
Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=y(n).
- Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=z(n).A080095
Let sum(k>=0, k^n/(2*k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=z(n).
- a(1) = a(2) = 1, a(3) = 2, thereafter a(n) = abs(a(n-1) - a(n-2) - a(n-3)).A080096
a(1) = a(2) = 1, a(3) = 2, thereafter a(n) = abs(a(n-1) - a(n-2) - a(n-3)).
- a(n) = Fibonacci(n+2)^2 - 1.A080097
a(n) = Fibonacci(n+2)^2 - 1.
- Triangle T(n,k) = n OR k, 0 <= k <= n, bitwise logical OR, read by rows.A080098
Triangle T(n,k) = n OR k, 0 <= k <= n, bitwise logical OR, read by rows.
- Triangle T(n,k) = n AND k, 0<=k<=n, bitwise logical AND, read by rows.A080099
Triangle T(n,k) = n AND k, 0<=k<=n, bitwise logical AND, read by rows.
- a(n) = 2^(number of 0's in binary representation of n).A080100
a(n) = 2^(number of 0's in binary representation of n).
- Number of prime powers in all composite numbers between n-th prime and next prime.A080101
Number of prime powers in all composite numbers between n-th prime and next prime.
- Smallest prime power in all composite numbers between n-th prime and next prime, a(n) = 1 if no such prime power exists.A080102
Smallest prime power in all composite numbers between n-th prime and next prime, a(n) = 1 if no such prime power exists.
- Greatest prime power in all composite numbers between n-th prime and next prime, a(n) = 1 if no such prime power exists.A080103
Greatest prime power in all composite numbers between n-th prime and next prime, a(n) = 1 if no such prime power exists.
- Le Corbusier's "modular" (or "modulor") numbers, based on the proportions of an ideal man.A080104
Le Corbusier's "modular" (or "modulor") numbers, based on the proportions of an ideal man.
- a(n) = round(113*phi^n).A080105
a(n) = round(113*phi^n).
- Round(226*phi^n).A080106
Round(226*phi^n).
- Number of fixed points of permutation of SetPartitions under {1,2,...,n}->{n,n-1,...,1}. Number of symmetric arrangements of non-attacking rooks on upper half of n X n chessboard.A080107
Number of fixed points of permutation of SetPartitions under {1,2,...,n}->{n,n-1,...,1}. Number of symmetric arrangements of non-attacking rooks on upper half of n X n chessboard.
- a(n) = Sum_{k=1..n} k^(n-k)*binomial(n-1,k-1).A080108
a(n) = Sum_{k=1..n} k^(n-k)*binomial(n-1,k-1).
- Square of primes of the form 4k+1 (A002144).A080109
Square of primes of the form 4k+1 (A002144).
- Characteristic function of A080112.A080110
Characteristic function of A080112.