Sequences
392,541 sequences
- Analog of 3x+1 function.A050411
Analog of 3x+1 function.
- Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.A050412
Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.
- Numbers k such that 74*2^k-1 is prime.A050413
Numbers k such that 74*2^k-1 is prime.
- Numbers k such that 2^k - 3 is prime.A050414
Numbers k such that 2^k - 3 is prime.
- Primes of the form 2^k - 3.A050415
Primes of the form 2^k - 3.
- a(1)=a(2)=1, then a(n+1) = floor(a(n)/3) if this is not among 0, a(1), ..., a(n); otherwise a(n+1) = a(n) + a(n-1).A050416
a(1)=a(2)=1, then a(n+1) = floor(a(n)/3) if this is not among 0, a(1), ..., a(n); otherwise a(n+1) = a(n) + a(n-1).
- Least k such that A050416(k) = n.A050417
Least k such that A050416(k) = n.
- Numbers k such that A050416(k) < A050416(k+1).A050418
Numbers k such that A050416(k) < A050416(k+1).
- Numbers k such that A050416(k) > A050416(k+1).A050419
Numbers k such that A050416(k) > A050416(k+1).
- Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 1.A050420
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 1.
- Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 2.A050421
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 2.
- Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 3.A050422
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 3.
- Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 4.A050423
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 4.
- Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 5.A050424
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 5.
- Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 1.A050425
Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 1.
- Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 2.A050426
Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 2.
- Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 3.A050427
Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 3.
- Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 4.A050428
Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 4.
- Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 5.A050429
Numbers for which in base 2 the least number of digits that can be removed to leave a base 2 palindromic number (beginning with 1) is 5.
- Length of longest palindromic subword of (n base 2).A050430
Length of longest palindromic subword of (n base 2).
- Length of longest palindromic subword of (n base 3).A050431
Length of longest palindromic subword of (n base 3).
- Length of longest palindromic subword of (n base 4).A050432
Length of longest palindromic subword of (n base 4).
- Length of longest palindromic subword of (n base 5).A050433
Length of longest palindromic subword of (n base 5).
- Primes whose next higher prime is 100 greater.A050434
Primes whose next higher prime is 100 greater.
- a(n) = composite(composite(n)), where composite = A002808, composite numbers.A050435
a(n) = composite(composite(n)), where composite = A002808, composite numbers.
- Third-order composites.A050436
Third-order composites.
- Dimension of space spanned by symmetric powers of n-dimensional standard representation of symmetric group S_n.A050437
Dimension of space spanned by symmetric powers of n-dimensional standard representation of symmetric group S_n.
- Fourth-order composites.A050438
Fourth-order composites.
- Fifth-order composites.A050439
Fifth-order composites.
- Sixth-order composites.A050440
Sixth-order composites.
- Partial sums of A051865.A050441
Partial sums of A051865.
- Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.A050442
Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.
- a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4).A050443
a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4).
- Primes setting records for earliest alphabetical position in American English.A050444
Primes setting records for earliest alphabetical position in American English.
- Each prime appears later in alphabetical order (in American English) than the one before.A050445
Each prime appears later in alphabetical order (in American English) than the one before.
- Table read by ascending antidiagonals: T(n, m) giving total degree of n-th-order elementary symmetric polynomials in m variables.A050446
Table read by ascending antidiagonals: T(n, m) giving total degree of n-th-order elementary symmetric polynomials in m variables.
- Table T(n,m) giving total degree of n-th-order elementary symmetric polynomials in m variables, -1 <= n, 1 <= m, transposed and read by upward antidiagonals.A050447
Table T(n,m) giving total degree of n-th-order elementary symmetric polynomials in m variables, -1 <= n, 1 <= m, transposed and read by upward antidiagonals.
- a(n) = Sum_{d|n, d==1 (mod 4)} d^4.A050448
a(n) = Sum_{d|n, d==1 (mod 4)} d^4.
- a(n) = Sum_{d|n, d == 1 (mod 4)} d.A050449
a(n) = Sum_{d|n, d == 1 (mod 4)} d.
- Sum_{d|n, d=1 mod 4} d^2.A050450
Sum_{d|n, d=1 mod 4} d^2.
- a(n) = Sum_{d|n, d=1 mod 4} d^3.A050451
a(n) = Sum_{d|n, d=1 mod 4} d^3.
- a(n) = Sum_{d|n, d == 3 (mod 4)} d.A050452
a(n) = Sum_{d|n, d == 3 (mod 4)} d.
- Sum_{d|n, d=3 mod 4} d^2.A050453
Sum_{d|n, d=3 mod 4} d^2.
- a(n) = Sum_{d|n, d=3 mod 4} d^3.A050454
a(n) = Sum_{d|n, d=3 mod 4} d^3.
- a(n) = Sum_{d|n, d=3 mod 4} d^4.A050455
a(n) = Sum_{d|n, d=3 mod 4} d^4.
- a(n) = Sum_{d|n, d==1 mod 4} d^4 - Sum_{d|n, d==3 mod 4} d^4.A050456
a(n) = Sum_{d|n, d==1 mod 4} d^4 - Sum_{d|n, d==3 mod 4} d^4.
- a(n) = Sum_{ d divides n, d==1 mod 4} d - Sum_{ d divides n, d==3 mod 4} d.A050457
a(n) = Sum_{ d divides n, d==1 mod 4} d - Sum_{ d divides n, d==3 mod 4} d.
- Difference between Sum_{d|n, d == 1 (mod 4)} d^2 and Sum_{d|n, d == 3 (mod 4)} d^2.A050458
Difference between Sum_{d|n, d == 1 (mod 4)} d^2 and Sum_{d|n, d == 3 (mod 4)} d^2.
- a(n) = Sum_{d|n, d==1 mod 4} d^3 - Sum_{d|n, d==3 mod 4} d^3.A050459
a(n) = Sum_{d|n, d==1 mod 4} d^3 - Sum_{d|n, d==3 mod 4} d^3.
- a(n) = Sum_{d|n, n/d=1 mod 4} d.A050460
a(n) = Sum_{d|n, n/d=1 mod 4} d.