Sequences
392,541 sequences
- Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).A050611
Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).
- Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).A050612
Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).
- Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).A050613
Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).
- Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).A050614
Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).
- Products of distinct terms of Fibonacci(2^(i+2)): a(n) = Product_{i=0..floor(log_2(n+1))} F(2^(i+2))^bit(n,i).A050615
Products of distinct terms of Fibonacci(2^(i+2)): a(n) = Product_{i=0..floor(log_2(n+1))} F(2^(i+2))^bit(n,i).
- Numbers k such that 149*2^k-1 is prime.A050616
Numbers k such that 149*2^k-1 is prime.
- Numbers n such that 151*2^n-1 is prime.A050617
Numbers n such that 151*2^n-1 is prime.
- Numbers k such that 153*2^k-1 is prime.A050618
Numbers k such that 153*2^k-1 is prime.
- Numbers n such that 155*2^n-1 is prime.A050619
Numbers n such that 155*2^n-1 is prime.
- Quotients arising from sequence A035014.A050620
Quotients arising from sequence A035014.
- Smallest n-digit number divisible by 2^n.A050621
Smallest n-digit number divisible by 2^n.
- Numbers m that are divisible by 2^k, where k is the digit length of m.A050622
Numbers m that are divisible by 2^k, where k is the digit length of m.
- Smallest n-digit number divisible by 3^n.A050623
Smallest n-digit number divisible by 3^n.
- Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n.A050624
Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n.
- Divisible by 3^k (where k is digit length of a(n)).A050625
Divisible by 3^k (where k is digit length of a(n)).
- Product of digits of n is a nonzero square.A050626
Product of digits of n is a nonzero square.
- Product of digits of n is a nonzero single-digit square.A050627
Product of digits of n is a nonzero single-digit square.
- a(1) = 1; a(n+1) is next smallest nontrivial square containing a(n) as a substring.A050628
a(1) = 1; a(n+1) is next smallest nontrivial square containing a(n) as a substring.
- a(n+1)^2 is next smallest nontrivial square containing a(n)^2 as a substring, initial term is 1.A050629
a(n+1)^2 is next smallest nontrivial square containing a(n)^2 as a substring, initial term is 1.
- a(n+1) is next smallest nontrivial square containing a(n) as a substring, initial term is 4.A050630
a(n+1) is next smallest nontrivial square containing a(n) as a substring, initial term is 4.
- a(1)=2; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.A050631
a(1)=2; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.
- a(n+1) is next smallest nontrivial square containing a(n) as a substring, initial term is 9.A050632
a(n+1) is next smallest nontrivial square containing a(n) as a substring, initial term is 9.
- a(1)=3; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.A050633
a(1)=3; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.
- a(n+1) is next smallest square ending with a(n), initial term is 1.A050634
a(n+1) is next smallest square ending with a(n), initial term is 1.
- a(n+1)^2 is next smallest square ending with a(n)^2, initial term is 1.A050635
a(n+1)^2 is next smallest square ending with a(n)^2, initial term is 1.
- a(n+1) is next smallest square ending with a(n), initial term is 4.A050636
a(n+1) is next smallest square ending with a(n), initial term is 4.
- a(1) = 2; a(n+1)^2 is next smallest square ending with a(n)^2.A050637
a(1) = 2; a(n+1)^2 is next smallest square ending with a(n)^2.
- a(n+1) is next smallest square ending with a(n), initial term is 9.A050638
a(n+1) is next smallest square ending with a(n), initial term is 9.
- a(1) = 3; a(n+1)^2 is next smallest square ending with a(n)^2.A050639
a(1) = 3; a(n+1)^2 is next smallest square ending with a(n)^2.
- a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 1.A050640
a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 1.
- a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring.A050641
a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring.
- a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 8.A050642
a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 8.
- a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring, initial term is 8.A050643
a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring, initial term is 8.
- a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 27.A050644
a(n+1) is next smallest nontrivial cube containing a(n) as a substring, initial term is 27.
- a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring, initial term is 27.A050645
a(n+1)^3 is next smallest nontrivial cube containing a(n)^3 as a substring, initial term is 27.
- a(n+1) is next smallest cube ending with a(n), initial term is 1.A050646
a(n+1) is next smallest cube ending with a(n), initial term is 1.
- a(n+1)^3 is next smallest cube ending with a(n)^3, initial term is 1.A050647
a(n+1)^3 is next smallest cube ending with a(n)^3, initial term is 1.
- a(n+1) is next smallest cube ending with a(n), initial term is 8.A050648
a(n+1) is next smallest cube ending with a(n), initial term is 8.
- a(n+1)^3 is next smallest cube ending with a(n)^3, initial term is 8.A050649
a(n+1)^3 is next smallest cube ending with a(n)^3, initial term is 8.
- a(n+1) is next smallest cube ending with a(n), initial term is 27.A050650
a(n+1) is next smallest cube ending with a(n), initial term is 27.
- a(n+1)^3 is next smallest cube ending with a(n)^3, a(1) = 3.A050651
a(n+1)^3 is next smallest cube ending with a(n)^3, a(1) = 3.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 1.A050652
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 1.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 2.A050653
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 2.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 3.A050654
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 3.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.A050655
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 5.A050656
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 5.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 6.A050657
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 6.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 7.A050658
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 7.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 8.A050659
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 8.
- Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 9.A050660
Numbers n such that number of primes produced according to rules stipulated in Honaker's A048853 is 9.