Sequences
392,541 sequences
- a(n) = A078217(n)/n.A078811
a(n) = A078217(n)/n.
- Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).A078812
Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
- Smallest prime factor of googol - n that exceeds 13, or 1 if googol - n is 13-smooth.A078813
Smallest prime factor of googol - n that exceeds 13, or 1 if googol - n is 13-smooth.
- Smallest prime factor of googolplex - n that exceeds 13, or 1 if googolplex - n is 13-smooth.A078814
Smallest prime factor of googolplex - n that exceeds 13, or 1 if googolplex - n is 13-smooth.
- a(n) = A078215(n+1)/A078215(n).A078815
a(n) = A078215(n+1)/A078215(n).
- Erroneous version of A081846.A078816
Erroneous version of A081846.
- Table by antidiagonals giving variants on Catalan sequence: T(n,k)=C(2n,n)*C(2k,k)*(2k+1)/(n+k+1).A078817
Table by antidiagonals giving variants on Catalan sequence: T(n,k)=C(2n,n)*C(2k,k)*(2k+1)/(n+k+1).
- a(n) = 30*binomial(2n,n)/(n+3).A078818
a(n) = 30*binomial(2n,n)/(n+3).
- a(n) = 140*C(2n,n)/(n+4).A078819
a(n) = 140*C(2n,n)/(n+4).
- a(n) = 20*C(2n,n)*(2n+1)/(n+4).A078820
a(n) = 20*C(2n,n)*(2n+1)/(n+4).
- Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's and all runlengths odd.A078821
Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's and all runlengths odd.
- Number of distinct binary numbers contained as substrings in the binary representation of n.A078822
Number of distinct binary numbers contained as substrings in the binary representation of n.
- Sum of distinct binary numbers contained as substrings in binary representation of n.A078823
Sum of distinct binary numbers contained as substrings in binary representation of n.
- Number of distinct binary numbers contained as substrings in binary, circular formed representation of n and not longer than n.A078824
Number of distinct binary numbers contained as substrings in binary, circular formed representation of n and not longer than n.
- Sum of distinct binary numbers contained as substrings in binary, circular formed representation of n and not longer than n.A078825
Sum of distinct binary numbers contained as substrings in binary, circular formed representation of n and not longer than n.
- Number of distinct primes contained as binary substrings in binary representation of n.A078826
Number of distinct primes contained as binary substrings in binary representation of n.
- Number of primes contained as binary substrings in binary representation of n, counted with repetitions.A078827
Number of primes contained as binary substrings in binary representation of n, counted with repetitions.
- Product of all primes contained as binary substrings in binary representation of n.A078828
Product of all primes contained as binary substrings in binary representation of n.
- Numbers having exactly one prime contained as binary substring in binary representation of n.A078829
Numbers having exactly one prime contained as binary substring in binary representation of n.
- Numbers having in binary representation exactly one binary substring representing a prime.A078830
Numbers having in binary representation exactly one binary substring representing a prime.
- Numbers n with unique occurrence of all binary substrings representing primes in binary representation of n.A078831
Numbers n with unique occurrence of all binary substrings representing primes in binary representation of n.
- Smallest prime contained as binary substring in binary representation of n>1, a(1)=1.A078832
Smallest prime contained as binary substring in binary representation of n>1, a(1)=1.
- Greatest prime contained as binary substring in binary representation of n>1, a(1)=1.A078833
Greatest prime contained as binary substring in binary representation of n>1, a(1)=1.
- Greatest prime factor of n also contained as binary substring in binary representation of n; a(n)=1, if no such factor exists.A078834
Greatest prime factor of n also contained as binary substring in binary representation of n; a(n)=1, if no such factor exists.
- Sum of the divisors of the average of consecutive odd primes.A078835
Sum of the divisors of the average of consecutive odd primes.
- a(n) = n*2^(n-6).A078836
a(n) = n*2^(n-6).
- a(n) = Sum_{k=1..prime(n)-1} floor(k^3/prime(n)).A078837
a(n) = Sum_{k=1..prime(n)-1} floor(k^3/prime(n)).
- a(n) = Sum_{k=1..(p-1)*(p-2)} floor((k*p)^(1/3)) where p is the n-th prime.A078838
a(n) = Sum_{k=1..(p-1)*(p-2)} floor((k*p)^(1/3)) where p is the n-th prime.
- Numbers k such that the binary expansion of 3^k has the same number of 0's and 1's.A078839
Numbers k such that the binary expansion of 3^k has the same number of 0's and 1's.
- Table of n-almost-primes T(n,k) (n >= 0, k > 0), read by antidiagonals, starting at T(0,1)=1 followed by T(1,1)=2.A078840
Table of n-almost-primes T(n,k) (n >= 0, k > 0), read by antidiagonals, starting at T(0,1)=1 followed by T(1,1)=2.
- Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.A078841
Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.
- Sums of the antidiagonals of the table of k-almost primes (A078840).A078842
Sums of the antidiagonals of the table of k-almost primes (A078840).
- Where 3^n occurs in n-almost primes, starting at a(0)=1.A078843
Where 3^n occurs in n-almost primes, starting at a(0)=1.
- Where 5^n occurs in n-almost-primes, starting at a(0)=1.A078844
Where 5^n occurs in n-almost-primes, starting at a(0)=1.
- Where 7^n occurs in n-almost-primes, starting at a(0)=1.A078845
Where 7^n occurs in n-almost-primes, starting at a(0)=1.
- Where 11^n occurs in n-almost-primes, starting at a(0)=1.A078846
Where 11^n occurs in n-almost-primes, starting at a(0)=1.
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <= 6 (i.e., when d = 2, 4 or 6) and forming pattern = [2, 4, 6]; short notation = [246] d-pattern.A078847
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <= 6 (i.e., when d = 2, 4 or 6) and forming pattern = [2, 4, 6]; short notation = [246] d-pattern.
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2,6,4]; short d-string notation of pattern = [264].A078848
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2,6,4]; short d-string notation of pattern = [264].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2, 6,6]; short d-string notation of pattern = [266].A078849
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2, 6,6]; short d-string notation of pattern = [266].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4,2,6]; short d-string notation of pattern = [426].A078850
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4,2,6]; short d-string notation of pattern = [426].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].A078851
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].A078852
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern=[6,2,4]; short d-string notation of pattern = [624].A078853
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern=[6,2,4]; short d-string notation of pattern = [624].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 2,6]; short d-string notation of pattern = [626].A078854
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 2,6]; short d-string notation of pattern = [626].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 4,2]; short d-string notation of pattern = [642].A078855
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 4,2]; short d-string notation of pattern = [642].
- Initial term in sequence of four consecutive primes whose consecutive differences have d-pattern = [6, 4, 6]; short d-string notation for pattern = [646].A078856
Initial term in sequence of four consecutive primes whose consecutive differences have d-pattern = [6, 4, 6]; short d-string notation for pattern = [646].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 6,2]; short d-string notation of pattern = [662].A078857
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 6,2]; short d-string notation of pattern = [662].
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern = [6, 6, 4]; short d-string notation of pattern = [664].A078858
Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern = [6, 6, 4]; short d-string notation of pattern = [664].
- Least positive residues (mod 210) representing those residue classes which can be the lesser of twin prime pairs (A001359).A078859
Least positive residues (mod 210) representing those residue classes which can be the lesser of twin prime pairs (A001359).
- Least positive residues [mod 210] representing those residue classes which can be lesser of prime pairs from A029710.A078860
Least positive residues [mod 210] representing those residue classes which can be lesser of prime pairs from A029710.