Sequences
392,541 sequences
- Triangular array: T(n,1)=T(n,n)=n, for 1<k<n: T(n,k) = concatenation of T(n-1,k-1) and T(n-1,k) in binary representation.A079661
Triangular array: T(n,1)=T(n,n)=n, for 1<k<n: T(n,k) = concatenation of T(n-1,k-1) and T(n-1,k) in binary representation.
- a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).A079662
a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).
- Sequence of the radicands that give the best radical approach to e.A079663
Sequence of the radicands that give the best radical approach to e.
- a(n) = Sum_{i=1..n} LookAndSay(i).A079664
a(n) = Sum_{i=1..n} LookAndSay(i).
- Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1.A079665
Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1.
- Least k such that the distance from k^2 to closest prime = n or zero if no k exists.A079666
Least k such that the distance from k^2 to closest prime = n or zero if no k exists.
- a(n) = (1/2) * Sum_{d divides n} abs(n/d-d).A079667
a(n) = (1/2) * Sum_{d divides n} abs(n/d-d).
- Start with 1; at n-th step, write down what is in the sequence so far.A079668
Start with 1; at n-th step, write down what is in the sequence so far.
- a(n) = least k such that the distance from Fibonacci(k) to the closest prime is n, or -1 if no such k exists.A079669
a(n) = least k such that the distance from Fibonacci(k) to the closest prime is n, or -1 if no such k exists.
- a(n) = (gcd(2^p-1, Fibonacci(p))-1)/(8p) > 0 where p = n-th prime from A080050.A079670
a(n) = (gcd(2^p-1, Fibonacci(p))-1)/(8p) > 0 where p = n-th prime from A080050.
- Number of irreducible polynomials (over the rationals) of form a*x^2+b*x+c, 1 <= a,b,c <= n.A079671
Number of irreducible polynomials (over the rationals) of form a*x^2+b*x+c, 1 <= a,b,c <= n.
- Numbers of the form (3^s+1)/(3^r+1) for s > 1, 1 <= r <= s-1.A079672
Numbers of the form (3^s+1)/(3^r+1) for s > 1, 1 <= r <= s-1.
- Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the r values; A079581 gives the s values.A079673
Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the r values; A079581 gives the s values.
- Continued fraction expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...A079674
Continued fraction expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...
- a(1)=1; a(n)=sum(u=1,n-1,sum(v=1,u,sum(w=1,v,sum(x=1, w,sum(y=1,x,a(y)))))).A079675
a(1)=1; a(n)=sum(u=1,n-1,sum(v=1,u,sum(w=1,v,sum(x=1, w,sum(y=1,x,a(y)))))).
- LookAndSay(n) is palindromic.A079676
LookAndSay(n) is palindromic.
- Distance from F(n) to closest prime, where F(n) is the n-th Fibonacci number.A079677
Distance from F(n) to closest prime, where F(n) is the n-th Fibonacci number.
- a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=5.A079678
a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=5.
- a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=6.A079679
a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=6.
- Number of 1's in n!.A079680
Number of 1's in n!.
- Duplicate of A034602.A079681
Duplicate of A034602.
- Order of Burnside group B(4,n) of exponent 4 and rank n.A079682
Order of Burnside group B(4,n) of exponent 4 and rank n.
- Order of Burnside group B(6,n) of exponent 6 and rank n.A079683
Order of Burnside group B(6,n) of exponent 6 and rank n.
- Number of 3's in n!.A079684
Number of 3's in n!.
- Degrees of irreducible representations of SL(2,5).A079685
Degrees of irreducible representations of SL(2,5).
- Start with 0; at n-th step, write down what is in the sequence so far.A079686
Start with 0; at n-th step, write down what is in the sequence so far.
- (C(p^2,p)-p)/p^5 where p runs through the primes >= 5.A079687
(C(p^2,p)-p)/p^5 where p runs through the primes >= 5.
- Number of 4's in n!.A079688
Number of 4's in n!.
- Determinant of the n X n matrix m(i,j)=binomial(max(i,j),min(i,j)).A079689
Determinant of the n X n matrix m(i,j)=binomial(max(i,j),min(i,j)).
- Number of 5's in n!.A079690
Number of 5's in n!.
- Number of 6's in n!.A079691
Number of 6's in n!.
- Number of 7's in n!.A079692
Number of 7's in n!.
- Number of 8's in n!.A079693
Number of 8's in n!.
- Number of 9's in n!.A079694
Number of 9's in n!.
- Values never taken by phi(j)/2 for any j: a(n) = A005277(n)/2.A079695
Values never taken by phi(j)/2 for any j: a(n) = A005277(n)/2.
- Numbers one more than composite numbers.A079696
Numbers one more than composite numbers.
- Odd part of A005277(n).A079697
Odd part of A005277(n).
- Values of the odd part of A005277(n).A079698
Values of the odd part of A005277(n).
- Duplicate of A053176.A079699
Duplicate of A053176.
- a(n) is the 2-adic valuation of the n-th even nontotient.A079700
a(n) is the 2-adic valuation of the n-th even nontotient.
- A congruence property: a(n) = (A026375(p)-3)/(2*p) where p is the n-th prime.A079701
A congruence property: a(n) = (A026375(p)-3)/(2*p) where p is the n-th prime.
- Numbers 2p where p is prime and 2p + 1 is composite.A079702
Numbers 2p where p is prime and 2p + 1 is composite.
- Numbers 4p where p is prime and 2p+1 and 4p+1 are composite.A079703
Numbers 4p where p is prime and 2p+1 and 4p+1 are composite.
- a(n) = 2*prime(n)^2.A079704
a(n) = 2*prime(n)^2.
- 3p^2 where p runs through the primes.A079705
3p^2 where p runs through the primes.
- Smallest positive exponent k such that (2n)^k+1 is prime, or -1 if no such k exists.A079706
Smallest positive exponent k such that (2n)^k+1 is prime, or -1 if no such k exists.
- In prime factorization of n replace odd primes with their prime predecessor.A079707
In prime factorization of n replace odd primes with their prime predecessor.
- Metaprime binary to standard binary conversion series.A079708
Metaprime binary to standard binary conversion series.
- Numbers m such that the squarefree kernel of m is less than the squarefree kernel of m+1.A079709
Numbers m such that the squarefree kernel of m is less than the squarefree kernel of m+1.
- Numbers m such that the squarefree kernel of m is larger than the squarefree kernel of m+1.A079710
Numbers m such that the squarefree kernel of m is larger than the squarefree kernel of m+1.