Sequences

392,541 sequences

Gaussian binomial coefficients [ n,10 ] for q = 9.A022261
Gaussian binomial coefficients [ n,10 ] for q = 9.
Gaussian binomial coefficients [ n,11 ] for q = 9.A022262
Gaussian binomial coefficients [ n,11 ] for q = 9.
Gaussian binomial coefficients [ n,12 ] for q = 9.A022263
Gaussian binomial coefficients [ n,12 ] for q = 9.
a(n) = n*(7*n - 1)/2.A022264
a(n) = n*(7*n - 1)/2.
a(n) = n*(7*n + 1)/2.A022265
a(n) = n*(7*n + 1)/2.
a(n) = n*(9*n - 1)/2.A022266
a(n) = n*(9*n - 1)/2.
a(n) = n*(9*n + 1)/2.A022267
a(n) = n*(9*n + 1)/2.
a(n) = n*(11*n - 1)/2.A022268
a(n) = n*(11*n - 1)/2.
a(n) = n*(11*n+1)/2.A022269
a(n) = n*(11*n+1)/2.
a(n) = n*(13*n - 1)/2.A022270
a(n) = n*(13*n - 1)/2.
a(n) = n*(13*n + 1)/2.A022271
a(n) = n*(13*n + 1)/2.
a(n) = n*(15*n - 1)/2.A022272
a(n) = n*(15*n - 1)/2.
a(n) = n*(15*n + 1)/2.A022273
a(n) = n*(15*n + 1)/2.
a(n) = n*(17*n - 1)/2.A022274
a(n) = n*(17*n - 1)/2.
a(n) = n*(17*n + 1)/2.A022275
a(n) = n*(17*n + 1)/2.
a(n) = n*(19*n - 1)/2.A022276
a(n) = n*(19*n - 1)/2.
a(n) = n*(19*n + 1)/2.A022277
a(n) = n*(19*n + 1)/2.
a(n) = n*(21*n-1)/2.A022278
a(n) = n*(21*n-1)/2.
a(n) = n*(21*n + 1)/2.A022279
a(n) = n*(21*n + 1)/2.
a(n) = n*(23*n - 1)/2.A022280
a(n) = n*(23*n - 1)/2.
a(n) = n*(23*n + 1)/2.A022281
a(n) = n*(23*n + 1)/2.
a(n) = n*(25*n - 1)/2.A022282
a(n) = n*(25*n - 1)/2.
a(n) = n*(25*n + 1)/2.A022283
a(n) = n*(25*n + 1)/2.
a(n) = n*(27*n - 1)/2.A022284
a(n) = n*(27*n - 1)/2.
a(n) = n*(27*n + 1)/2.A022285
a(n) = n*(27*n + 1)/2.
a(n) = n*(29*n - 1)/2.A022286
a(n) = n*(29*n - 1)/2.
a(n) = n*(29*n + 1)/2.A022287
a(n) = n*(29*n + 1)/2.
a(n) = n*(31*n-1)/2.A022288
a(n) = n*(31*n-1)/2.
a(n) = n*(31*n + 1)/2.A022289
a(n) = n*(31*n + 1)/2.
Replace 2^k in binary expansion of n with Fibonacci(k+2).A022290
Replace 2^k in binary expansion of n with Fibonacci(k+2).
Expansion of 1/((1-x)*(1-5*x)*(1-6*x)*(1-9*x)).A022291
Expansion of 1/((1-x)*(1-5*x)*(1-6*x)*(1-9*x)).
Exactly half of first a(n) terms of Kolakoski sequence A000002 are 1's (not known to be infinite).A022292
Exactly half of first a(n) terms of Kolakoski sequence A000002 are 1's (not known to be infinite).
Sequence A022292 divided by 2.A022293
Sequence A022292 divided by 2.
a(n) is the least k>1 such that first n terms of Kolakoski sequence A000002 repeat beginning at k-th term.A022294
a(n) is the least k>1 such that first n terms of Kolakoski sequence A000002 repeat beginning at k-th term.
Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.A022295
Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.
Least k>1 such that complement of first n terms of Kolakoski sequence (A000002) repeats beginning at k-th term.A022296
Least k>1 such that complement of first n terms of Kolakoski sequence (A000002) repeats beginning at k-th term.
Index of n-th 1 in A006928.A022297
Index of n-th 1 in A006928.
Exactly half of first n terms of A006928 are 1's (not known to be infinite).A022298
Exactly half of first n terms of A006928 are 1's (not known to be infinite).
Sequence A022298 divided by 2.A022299
Sequence A022298 divided by 2.
The sequence a of 1's and 2's starting with (1,1,2,1) such that a(n) is the length of the (n+2)nd run of a.A022300
The sequence a of 1's and 2's starting with (1,1,2,1) such that a(n) is the length of the (n+2)nd run of a.
Index of n-th 1 in A022300.A022301
Index of n-th 1 in A022300.
Least k such that first k terms of A022300 contain n more 1's than 2's.A022302
Least k such that first k terms of A022300 contain n more 1's than 2's.
The sequence a of 1's and 2's starting with (1,2,1) such that a(n) is the length of the (n+2)nd run of a.A022303
The sequence a of 1's and 2's starting with (1,2,1) such that a(n) is the length of the (n+2)nd run of a.
Index of n-th 1 in A022303.A022304
Index of n-th 1 in A022303.
Exactly half the first a(n) terms of A022303 are 1's.A022305
Exactly half the first a(n) terms of A022303 are 1's.
Sequence A022305 divided by 2.A022306
Sequence A022305 divided by 2.
Number of distinct prime factors of n-th Fibonacci number.A022307
Number of distinct prime factors of n-th Fibonacci number.
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.A022308
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=4.A022309
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=4.
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=5.A022310
a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=5.