Sequences
392,541 sequences
- Euclid-Mullin sequence (A000945) with initial value a(1)=17 instead of a(1)=2.A051311
Euclid-Mullin sequence (A000945) with initial value a(1)=17 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=19 instead of a(1)=2.A051312
Euclid-Mullin sequence (A000945) with initial value a(1)=19 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=23 instead of a(1)=2.A051313
Euclid-Mullin sequence (A000945) with initial value a(1)=23 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=29 instead of a(1)=2.A051314
Euclid-Mullin sequence (A000945) with initial value a(1)=29 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=31 instead of a(1)=2.A051315
Euclid-Mullin sequence (A000945) with initial value a(1)=31 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=37 instead of a(1)=2.A051316
Euclid-Mullin sequence (A000945) with initial value a(1)=37 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=41 instead of a(1)=2.A051317
Euclid-Mullin sequence (A000945) with initial value a(1)=41 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=43 instead of a(1)=2.A051318
Euclid-Mullin sequence (A000945) with initial value a(1)=43 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=47 instead of a(1)=2.A051319
Euclid-Mullin sequence (A000945) with initial value a(1)=47 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=53 instead of a(1)=2.A051320
Euclid-Mullin sequence (A000945) with initial value a(1)=53 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=59 instead of a(1)=2.A051321
Euclid-Mullin sequence (A000945) with initial value a(1)=59 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=61 instead of a(1)=2.A051322
Euclid-Mullin sequence (A000945) with initial value a(1)=61 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=67 instead of a(1)=2.A051323
Euclid-Mullin sequence (A000945) with initial value a(1)=67 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=71 instead of a(1)=2.A051324
Euclid-Mullin sequence (A000945) with initial value a(1)=71 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=73 instead of a(1)=2.A051325
Euclid-Mullin sequence (A000945) with initial value a(1)=73 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=79 instead of a(1)=2.A051326
Euclid-Mullin sequence (A000945) with initial value a(1)=79 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=83 instead of a(1)=2.A051327
Euclid-Mullin sequence (A000945) with initial value a(1)=83 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=89 instead of a(1)=2.A051328
Euclid-Mullin sequence (A000945) with initial value a(1)=89 instead of a(1)=2.
- A generalized Thue-Morse sequence.A051329
A generalized Thue-Morse sequence.
- Euclid-Mullin sequence (A000945) with initial value a(1)=97 instead of a(1)=2.A051330
Euclid-Mullin sequence (A000945) with initial value a(1)=97 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=131071 instead of a(1)=2.A051331
Euclid-Mullin sequence (A000945) with initial value a(1)=131071 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=65537 instead of a(1)=2.A051332
Euclid-Mullin sequence (A000945) with initial value a(1)=65537 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=257 instead of a(1)=2.A051333
Euclid-Mullin sequence (A000945) with initial value a(1)=257 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=8191 instead of a(1)=2.A051334
Euclid-Mullin sequence (A000945) with initial value a(1)=8191 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=127 instead of a(1)=2.A051335
Euclid-Mullin sequence (A000945) with initial value a(1)=127 instead of a(1)=2.
- Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.A051336
Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.
- Number of strongly connected tournaments on n nodes.A051337
Number of strongly connected tournaments on n nodes.
- Generalized Stirling number triangle of first kind.A051338
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of first kind.A051339
Generalized Stirling number triangle of first kind.
- A simple 2-dimensional array, read by antidiagonals: T[i,j] = 1 for j>0, T[i,0] = i+1; i,j = 0,1,2,3,...A051340
A simple 2-dimensional array, read by antidiagonals: T[i,j] = 1 for j>0, T[i,0] = i+1; i,j = 0,1,2,3,...
- A simple 2-dimensional array, read by antidiagonals.A051341
A simple 2-dimensional array, read by antidiagonals.
- Smallest prime factor of 1 + (product of first n primes).A051342
Smallest prime factor of 1 + (product of first n primes).
- Number of ways of writing n as a sum of 3 nonnegative cubes (counted naively).A051343
Number of ways of writing n as a sum of 3 nonnegative cubes (counted naively).
- Number of ways of writing n as a sum of 3 positive cubes (counted naively).A051344
Number of ways of writing n as a sum of 3 positive cubes (counted naively).
- Odd numbers not of the form 3 + twin prime + twin prime.A051345
Odd numbers not of the form 3 + twin prime + twin prime.
- Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.A051346
Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.
- Numbers that are the sum of two (possibly negative) cubes in at least 2 ways.A051347
Numbers that are the sum of two (possibly negative) cubes in at least 2 ways.
- a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.A051348
a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.
- Sum of first n nonprimes.A051349
Sum of first n nonprimes.
- Sum of digit-sums of first n nonprimes.A051350
Sum of digit-sums of first n nonprimes.
- a(n) = a(n-1) + sum of digits of n-th prime.A051351
a(n) = a(n-1) + sum of digits of n-th prime.
- a(0) = 0; for n>0, a(n) = a(n-1) + n if n not prime else a(n-1) - n.A051352
a(0) = 0; for n>0, a(n) = a(n-1) + n if n not prime else a(n-1) - n.
- a(n) = a(n-1) + n^2 if n prime else a(n-1) - n, starting with a(0) = 0.A051353
a(n) = a(n-1) + n^2 if n prime else a(n-1) - n, starting with a(0) = 0.
- Expansion of Molien series for 16-dimensional complex Clifford group of genus 4 and order 97029351014400.A051354
Expansion of Molien series for 16-dimensional complex Clifford group of genus 4 and order 97029351014400.
- A class of Boolean functions of n variables and rank 5.A051355
A class of Boolean functions of n variables and rank 5.
- Start with 0, run through primes >=5, adding if -1 mod 6, subtracting if +1 mod 6.A051356
Start with 0, run through primes >=5, adding if -1 mod 6, subtracting if +1 mod 6.
- Chernoff sequence A006939 divided by 2.A051357
Chernoff sequence A006939 divided by 2.
- (Terms in A028279)/2.A051358
(Terms in A028279)/2.
- (Terms in A028286)/2.A051359
(Terms in A028286)/2.
- A class of Boolean functions of n variables and rank 4.A051360
A class of Boolean functions of n variables and rank 4.