Sequences
392,541 sequences
- a(n) = binomial(n, smallest prime factor of n).A080211
a(n) = binomial(n, smallest prime factor of n).
- Binomial(n, smallest odd prime factor of n).A080212
Binomial(n, smallest odd prime factor of n).
- a(n) = binomial(n, greatest prime factor of n).A080213
a(n) = binomial(n, greatest prime factor of n).
- Binomial(greatest prime factor of n, smallest prime factor of n).A080214
Binomial(greatest prime factor of n, smallest prime factor of n).
- Binomial(greatest prime factor of n, smallest odd prime factor of n).A080215
Binomial(greatest prime factor of n, smallest odd prime factor of n).
- a(n) is the largest value taken by binomial(n,j) mod j for j in [1..n].A080216
a(n) is the largest value taken by binomial(n,j) mod j for j in [1..n].
- a(n) is the number of distinct values taken by binomial(n,j) mod j for j in [1..n].A080217
a(n) is the number of distinct values taken by binomial(n,j) mod j for j in [1..n].
- Monotonically increasing sequence such that every positive integer n appears if and only if d(n) doesn't (d(n)=number of divisors of n, A000005).A080218
Monotonically increasing sequence such that every positive integer n appears if and only if d(n) doesn't (d(n)=number of divisors of n, A000005).
- Decimal expansion of exponential factorial constant Sum_{n>=1} 1/A049384(n).A080219
Decimal expansion of exponential factorial constant Sum_{n>=1} 1/A049384(n).
- a(1)=2; then if n is prime, a(n) is the smallest prime number greater than a(n-1), if n is composite a(n)=a(n-1)+1.A080220
a(1)=2; then if n is prime, a(n) is the smallest prime number greater than a(n-1), if n is composite a(n)=a(n-1)+1.
- n is Harshad (divisible by the sum of its digits) in a(n) bases from 1 to n.A080221
n is Harshad (divisible by the sum of its digits) in a(n) bases from 1 to n.
- Record-setting differences between adjacent elements of the Mian-Chowla sequence A005282.A080222
Record-setting differences between adjacent elements of the Mian-Chowla sequence A005282.
- Record-setting differences between adjacent elements of the Mian-Chowla sequence variant A051788.A080223
Record-setting differences between adjacent elements of the Mian-Chowla sequence variant A051788.
- Number of abundant divisors of n.A080224
Number of abundant divisors of n.
- Number of perfect divisors of n.A080225
Number of perfect divisors of n.
- Number of deficient divisors of n.A080226
Number of deficient divisors of n.
- a(n) = n*a(n-1) + (1/2)*(1+(-1)^n), a(0)=0.A080227
a(n) = n*a(n-1) + (1/2)*(1+(-1)^n), a(0)=0.
- Numbers containing the digits 0, 1, 2, 5 or 8 only.A080228
Numbers containing the digits 0, 1, 2, 5 or 8 only.
- Number of terms in the continued fraction for x, where x is the Golden ratio (phi=(1+sqrt(5))/2) truncated to n decimal digits.A080229
Number of terms in the continued fraction for x, where x is the Golden ratio (phi=(1+sqrt(5))/2) truncated to n decimal digits.
- Engel expansion for (positive) constant defined in A078756.A080230
Engel expansion for (positive) constant defined in A078756.
- Engel expansion for (negative) constant defined in A078756.A080231
Engel expansion for (negative) constant defined in A078756.
- Triangle T(n,k) of differences of pairs of consecutive terms of triangle A071919.A080232
Triangle T(n,k) of differences of pairs of consecutive terms of triangle A071919.
- Triangle T(n,k) obtained by taking differences of consecutive pairs of row elements of Pascal's triangle A007318.A080233
Triangle T(n,k) obtained by taking differences of consecutive pairs of row elements of Pascal's triangle A007318.
- Triangle whose rows are the differences of consecutive pairs of row elements of A080232.A080234
Triangle whose rows are the differences of consecutive pairs of row elements of A080232.
- Number of terms in the continued fraction for (Pi truncated to n decimal digits).A080235
Number of terms in the continued fraction for (Pi truncated to n decimal digits).
- Triangle of differences of consecutive pairs of row elements of triangle A080233.A080236
Triangle of differences of consecutive pairs of row elements of triangle A080233.
- Start with 1 and apply the process: k-th run is 1, 2, 3, ..., a(k-1)+1.A080237
Start with 1 and apply the process: k-th run is 1, 2, 3, ..., a(k-1)+1.
- Largest squarefree number dividing sum of cubes of divisors of n.A080238
Largest squarefree number dividing sum of cubes of divisors of n.
- Antidiagonal sums of triangle A035317.A080239
Antidiagonal sums of triangle A035317.
- Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives A_n.A080240
Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives A_n.
- Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives B_n.A080241
Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives B_n.
- Table of coefficients of polynomials P(n,x) defined by the relation P(n,x) = (1+x)*P(n-1,x) + (-x)^(n+1).A080242
Table of coefficients of polynomials P(n,x) defined by the relation P(n,x) = (1+x)*P(n-1,x) + (-x)^(n+1).
- Signed super-Catalan or little Schroeder numbers.A080243
Signed super-Catalan or little Schroeder numbers.
- Signed generalized Fibonacci numbers.A080244
Signed generalized Fibonacci numbers.
- Inverse of coordination sequence array A113413.A080245
Inverse of coordination sequence array A113413.
- Signed version of A035607.A080246
Signed version of A035607.
- Formal inverse of triangle A080246. Unsigned version of A080245.A080247
Formal inverse of triangle A080246. Unsigned version of A080245.
- Stirling-like number triangle defined by sequence A000217.A080248
Stirling-like number triangle defined by sequence A000217.
- Stirling-like number triangle defined by the sequence A000292=C(n+3,3).A080249
Stirling-like number triangle defined by the sequence A000292=C(n+3,3).
- Expansion of 1/((1-x)(1-4x)(1-10x)(1-20x)).A080250
Expansion of 1/((1-x)(1-4x)(1-10x)(1-20x)).
- Paired decomposition of tetrahedral numbers A000292 arranged as number triangle.A080251
Paired decomposition of tetrahedral numbers A000292 arranged as number triangle.
- a(n) = n*a(n-1)+4*a(n-2)-4*(n-2)*a(n-3).A080252
a(n) = n*a(n-1)+4*a(n-2)-4*(n-2)*a(n-3).
- a(n) is the number of elements in the Coxeter complex of type B_n (or C_n).A080253
a(n) is the number of elements in the Coxeter complex of type B_n (or C_n).
- For n>3, a(n) is the number of elements in the Coxeter complex of type D_n (although the sequence starts at n=0. See comments below for precise explanation).A080254
For n>3, a(n) is the number of elements in the Coxeter complex of type D_n (although the sequence starts at n=0. See comments below for precise explanation).
- Antisquares: of the form a*p^k where p is prime, k is odd and a is nonsquare modulo p.A080255
Antisquares: of the form a*p^k where p is prime, k is odd and a is nonsquare modulo p.
- Sum of numbers of distinct and of all prime factors of n.A080256
Sum of numbers of distinct and of all prime factors of n.
- Numbers having at least two distinct or a total of at least three prime factors.A080257
Numbers having at least two distinct or a total of at least three prime factors.
- Either 4th power of a prime, or product of a prime and the square of a different prime.A080258
Either 4th power of a prime, or product of a prime and the square of a different prime.
- Numbers whose squarefree kernel is not a primorial number, i.e., A007947(a(n)) is not in A002110.A080259
Numbers whose squarefree kernel is not a primorial number, i.e., A007947(a(n)) is not in A002110.
- a(n)=1+(1/12)(n*(n+1)*(n+3)*(4-n)).A080260
a(n)=1+(1/12)(n*(n+1)*(n+3)*(4-n)).