Sequences
392,541 sequences
- Numbers n such that 71*2^n-1 is prime.A050561
Numbers n such that 71*2^n-1 is prime.
- Numbers n such that 73*2^n-1 is prime.A050562
Numbers n such that 73*2^n-1 is prime.
- Numbers k such that 75*2^k-1 is prime.A050563
Numbers k such that 75*2^k-1 is prime.
- Numbers n such that 77*2^n-1 is prime.A050564
Numbers n such that 77*2^n-1 is prime.
- Numbers k such that 79*2^k-1 is prime.A050565
Numbers k such that 79*2^k-1 is prime.
- Numbers n such that 81*2^n-1 is prime.A050566
Numbers n such that 81*2^n-1 is prime.
- Numbers n such that 83*2^n-1 is prime.A050567
Numbers n such that 83*2^n-1 is prime.
- Numbers n such that 85*2^n-1 is prime.A050568
Numbers n such that 85*2^n-1 is prime.
- Numbers n such that 87*2^n-1 is prime.A050569
Numbers n such that 87*2^n-1 is prime.
- Numbers n such that 89*2^n-1 is prime.A050570
Numbers n such that 89*2^n-1 is prime.
- Numbers n such that 91*2^n-1 is prime.A050571
Numbers n such that 91*2^n-1 is prime.
- Numbers n such that 93*2^n-1 is prime.A050572
Numbers n such that 93*2^n-1 is prime.
- Numbers k such that 95*2^k-1 is prime.A050573
Numbers k such that 95*2^k-1 is prime.
- Numbers n such that 97*2^n-1 is prime.A050574
Numbers n such that 97*2^n-1 is prime.
- Numbers n such that 99*2^n-1 is prime.A050575
Numbers n such that 99*2^n-1 is prime.
- Numbers n such that 101*2^n-1 is prime.A050576
Numbers n such that 101*2^n-1 is prime.
- Numbers n such that 103*2^n-1 is prime.A050577
Numbers n such that 103*2^n-1 is prime.
- Numbers n such that 105*2^n-1 is prime.A050578
Numbers n such that 105*2^n-1 is prime.
- Numbers n such that 107*2^n-1 is prime.A050579
Numbers n such that 107*2^n-1 is prime.
- Numbers n such that 109*2^n-1 is prime.A050580
Numbers n such that 109*2^n-1 is prime.
- Numbers k such that 111*2^k-1 is prime.A050581
Numbers k such that 111*2^k-1 is prime.
- Numbers k such that 113*2^k-1 is prime.A050582
Numbers k such that 113*2^k-1 is prime.
- Numbers n such that 115*2^n-1 is prime.A050583
Numbers n such that 115*2^n-1 is prime.
- Numbers n such that 117*2^n-1 is prime.A050584
Numbers n such that 117*2^n-1 is prime.
- Numbers n such that 119*2^n-1 is prime.A050585
Numbers n such that 119*2^n-1 is prime.
- Numbers n such that 121*2^n-1 is a prime.A050586
Numbers n such that 121*2^n-1 is a prime.
- Numbers n such that 123*2^n-1 is prime.A050587
Numbers n such that 123*2^n-1 is prime.
- Numbers n such that 125*2^n-1 is prime.A050588
Numbers n such that 125*2^n-1 is prime.
- Numbers k such that 127*2^k - 1 is prime.A050589
Numbers k such that 127*2^k - 1 is prime.
- Numbers k such that 129*2^k-1 is prime.A050590
Numbers k such that 129*2^k-1 is prime.
- Numbers n such that 131*2^n-1 is prime.A050591
Numbers n such that 131*2^n-1 is prime.
- Numbers n such that 133*2^n-1 is prime.A050592
Numbers n such that 133*2^n-1 is prime.
- Numbers k such that 135*2^k-1 is prime.A050593
Numbers k such that 135*2^k-1 is prime.
- Numbers n such that 137*2^n-1 is prime.A050594
Numbers n such that 137*2^n-1 is prime.
- Numbers k such that 139*2^k-1 is prime.A050595
Numbers k such that 139*2^k-1 is prime.
- Numbers n such that 141*2^n-1 is prime.A050596
Numbers n such that 141*2^n-1 is prime.
- Numbers n such that 143*2^n-1 is prime.A050597
Numbers n such that 143*2^n-1 is prime.
- Numbers n such that 145*2^n-1 is prime.A050598
Numbers n such that 145*2^n-1 is prime.
- Numbers n such that 147*2^n-1 is prime.A050599
Numbers n such that 147*2^n-1 is prime.
- Recursion counts for summation table A003056 with formula a(y,0) = y, a(y,x) = a((y XOR x),2*(y AND x)).A050600
Recursion counts for summation table A003056 with formula a(y,0) = y, a(y,x) = a((y XOR x),2*(y AND x)).
- Recursion counts for summation table A003056 with formula a(0,x) = x, a(y,0) = y, a(y,x) = a((y XOR x),2*(y AND x)).A050601
Recursion counts for summation table A003056 with formula a(0,x) = x, a(y,0) = y, a(y,x) = a((y XOR x),2*(y AND x)).
- Square array A(x,y), read by antidiagonals, where A(x,y) = 0 if (x AND y) = 0, otherwise A(x,y) = 1+A(x XOR y, 2*(x AND y)).A050602
Square array A(x,y), read by antidiagonals, where A(x,y) = 0 if (x AND y) = 0, otherwise A(x,y) = 1+A(x XOR y, 2*(x AND y)).
- A001511 with every term repeated.A050603
A001511 with every term repeated.
- Column 3 of A050600: a(n) = add1c(n,3).A050604
Column 3 of A050600: a(n) = add1c(n,3).
- Column/row 2 of A050602: a(n) = add3c(n,2).A050605
Column/row 2 of A050602: a(n) = add3c(n,2).
- Column/row 3 of A050602: a(n) = add3c(n,3).A050606
Column/row 3 of A050602: a(n) = add3c(n,3).
- Numbers k such that base 5 expansion matches (0|1|2)*((0|1)(3|4))?(0|1|2)*.A050607
Numbers k such that base 5 expansion matches (0|1|2)*((0|1)(3|4))?(0|1|2)*.
- Numbers k such that base 7 expansion matches (0|1|2|3)*((0|1|2)(4|5|6))?(0|1|2|3)*.A050608
Numbers k such that base 7 expansion matches (0|1|2|3)*((0|1|2)(4|5|6))?(0|1|2|3)*.
- Table T(n,k) = Sum_{i=0..2n} (C(2n,i) mod 2)*F(i+k) = Sum_{i=0..n} (C(n,i) mod 2)*F(2i+k).A050609
Table T(n,k) = Sum_{i=0..2n} (C(2n,i) mod 2)*F(i+k) = Sum_{i=0..n} (C(n,i) mod 2)*F(2i+k).
- Sum_{i=0..y} (C(y,i) mod 2)*F(2i+x) = FL(y+x)*A050613(y), where A050613(y) = Product_{i=0..floor(log_2(y+1))} L(2^i)^bit(y,i).A050610
Sum_{i=0..y} (C(y,i) mod 2)*F(2i+x) = FL(y+x)*A050613(y), where A050613(y) = Product_{i=0..floor(log_2(y+1))} L(2^i)^bit(y,i).