Sequences

392,541 sequences

Next prime after 3^n.A014211
Next prime after 3^n.
Inverse of 203rd cyclotomic polynomial.A014212
Inverse of 203rd cyclotomic polynomial.
Floor((e/2)^n).A014213
Floor((e/2)^n).
a(n) = floor((Pi/2)^n).A014214
a(n) = floor((Pi/2)^n).
[ sqrt(3/2)^n ].A014215
[ sqrt(3/2)^n ].
a(n) = floor(log(5)^n).A014216
a(n) = floor(log(5)^n).
a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.A014217
a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.
Inverse of 209th cyclotomic polynomial.A014218
Inverse of 209th cyclotomic polynomial.
Inverse of 210th cyclotomic polynomial.A014219
Inverse of 210th cyclotomic polynomial.
Next prime after n^3.A014220
Next prime after n^3.
a(n+1) = 2^a(n) with a(-1) = 0.A014221
a(n+1) = 2^a(n) with a(-1) = 0.
a(0) = 0; thereafter a(n+1) = 3^a(n).A014222
a(0) = 0; thereafter a(n+1) = 3^a(n).
Odd primes such that (3p+1)/2 and 3p+4 are also prime.A014223
Odd primes such that (3p+1)/2 and 3p+4 are also prime.
Numbers k such that 3^k - 2 is prime.A014224
Numbers k such that 3^k - 2 is prime.
Number of initial pieces needed to reach level n in the Solitaire Army game.A014225
Number of initial pieces needed to reach level n in the Solitaire Army game.
Inverse of 217th cyclotomic polynomial.A014226
Inverse of 217th cyclotomic polynomial.
Minimal number of initial pieces needed to reach level n in the Solitaire Army game on a hexagonal lattice (a finite sequence).A014227
Minimal number of initial pieces needed to reach level n in the Solitaire Army game on a hexagonal lattice (a finite sequence).
Product of 3 successive Catalan numbers.A014228
Product of 3 successive Catalan numbers.
Inverse of 220th cyclotomic polynomial.A014229
Inverse of 220th cyclotomic polynomial.
Inverse of 221st cyclotomic polynomial.A014230
Inverse of 221st cyclotomic polynomial.
(Product of 3 successive Catalan numbers)/2.A014231
(Product of 3 successive Catalan numbers)/2.
Primes of the form 3^k - 2.A014232
Primes of the form 3^k - 2.
Smallest odd number for which Miller-Rabin primality test on bases <= n-th prime does not reveal compositeness.A014233
Smallest odd number for which Miller-Rabin primality test on bases <= n-th prime does not reveal compositeness.
Largest prime <= 2^n.A014234
Largest prime <= 2^n.
Number of n X n matrices with entries 0 and 1 and no 2 X 2 submatrix of form [ 1 1; 1 0 ].A014235
Number of n X n matrices with entries 0 and 1 and no 2 X 2 submatrix of form [ 1 1; 1 0 ].
Expansion of g.f.: 2*x*(1-x)/((1-2*x)*(1-2*x^2)).A014236
Expansion of g.f.: 2*x*(1-x)/((1-2*x)*(1-2*x^2)).
a(n) = (n-th prime) - (n-th nonprime).A014237
a(n) = (n-th prime) - (n-th nonprime).
a(n) = (n-th number that is 1 or prime) - (n-th composite number).A014238
a(n) = (n-th number that is 1 or prime) - (n-th composite number).
Inverse of 230th cyclotomic polynomial.A014239
Inverse of 230th cyclotomic polynomial.
Inverse of 231st cyclotomic polynomial.A014240
Inverse of 231st cyclotomic polynomial.
a(n) = ((n+1)-st Fibonacci number) - (n-th non-Fibonacci number).A014241
a(n) = ((n+1)-st Fibonacci number) - (n-th non-Fibonacci number).
(n-th Fibonacci number that is not 1) - (n-th number that is 1 or not a Fibonacci number).A014242
(n-th Fibonacci number that is not 1) - (n-th number that is 1 or not a Fibonacci number).
a(n) = ((n+1)-st Lucas number) - (n-th non-Lucas number).A014243
a(n) = ((n+1)-st Lucas number) - (n-th non-Lucas number).
(n-th Lucas number that is not 1) - (n-th number that is 1 or not a Lucas number).A014244
(n-th Lucas number that is not 1) - (n-th number that is 1 or not a Lucas number).
a(n) = (n-th term of Beatty sequence for (3+sqrt(3))/2) - (n-th term of Beatty sequence for sqrt(3)).A014245
a(n) = (n-th term of Beatty sequence for (3+sqrt(3))/2) - (n-th term of Beatty sequence for sqrt(3)).
a(n) = (n-th term of Beatty sequence for e) - (n-th term of Beatty sequence for e/(e-1)).A014246
a(n) = (n-th term of Beatty sequence for e) - (n-th term of Beatty sequence for e/(e-1)).
Inverse of 238th cyclotomic polynomial.A014247
Inverse of 238th cyclotomic polynomial.
a(n) = b(n) - c(n) where b(n) = [ n*(sqrt(2)+sqrt(3)) ] and c(n) is the n-th number not in sequence b( ).A014248
a(n) = b(n) - c(n) where b(n) = [ n*(sqrt(2)+sqrt(3)) ] and c(n) is the n-th number not in sequence b( ).
a(n) = b(n) - c(n) where b(n) = [n*sqrt(2)] + [n*sqrt(3)] and c(n) is the n-th number not in sequence b.A014249
a(n) = b(n) - c(n) where b(n) = [n*sqrt(2)] + [n*sqrt(3)] and c(n) is the n-th number not in sequence b.
a(n) = b(n) - c(n) where b(n) = [ (3/2)^n ] and c(n) is the n-th number not in sequence b.A014250
a(n) = b(n) - c(n) where b(n) = [ (3/2)^n ] and c(n) is the n-th number not in sequence b.
a(n) = b(n) - c(n) where b(n) is the n-th Fibonacci number greater than 2 and c(n) is the n-th number not in sequence b( ).A014251
a(n) = b(n) - c(n) where b(n) is the n-th Fibonacci number greater than 2 and c(n) is the n-th number not in sequence b( ).
a(n) = b(n) - c(n) where b(n) is the n-th Lucas number greater than 3 and c(n) is the n-th number not in sequence b( ).A014252
a(n) = b(n) - c(n) where b(n) is the n-th Lucas number greater than 3 and c(n) is the n-th number not in sequence b( ).
a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283).A014253
a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283).
Liponombres: numbers whose French name does not contain the letter "e".A014254
Liponombres: numbers whose French name does not contain the letter "e".
Expansion of (1+2*x+3*x^2)/((1-x)*(1-x^2)^2).A014255
Expansion of (1+2*x+3*x^2)/((1-x)*(1-x^2)^2).
Inverse of 247th cyclotomic polynomial.A014256
Inverse of 247th cyclotomic polynomial.
Product of digits of 2^n.A014257
Product of digits of 2^n.
Iccanobif numbers: add previous two terms and reverse the sum.A014258
Iccanobif numbers: add previous two terms and reverse the sum.
Iccanobif numbers: add reversal of a(n-1) to a(n-2).A014259
Iccanobif numbers: add reversal of a(n-1) to a(n-2).
Iccanobif numbers: add a(n-1) to reversal of a(n-2).A014260
Iccanobif numbers: add a(n-1) to reversal of a(n-2).