Sequences
392,541 sequences
- Numbers d such that, for some k, the upper and lower primes closest to k! are k! + d and k! - d.A053711
Numbers d such that, for some k, the upper and lower primes closest to k! are k! + d and k! - d.
- Lower balancing primes to prime-balanced factorials.A053712
Lower balancing primes to prime-balanced factorials.
- Upper balancing primes to prime-balanced factorials.A053713
Upper balancing primes to prime-balanced factorials.
- Smallest (in magnitude) nonzero number m such that n!+m is prime.A053714
Smallest (in magnitude) nonzero number m such that n!+m is prime.
- a(n) = n-th triangular number (the sum of the first n integers) in base n.A053715
a(n) = n-th triangular number (the sum of the first n integers) in base n.
- a(n) = 1111111 in base n.A053716
a(n) = 1111111 in base n.
- a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.A053717
a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.
- Number of n X n binary matrices of order dividing 4 (also number of solutions to X^4=I in GL(n,2)).A053718
Number of n X n binary matrices of order dividing 4 (also number of solutions to X^4=I in GL(n,2)).
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.A053719
Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.A053720
Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.A053721
Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.
- Number of n X n binary matrices of order dividing 2 (also number of solutions to X^2=I in GL(n,2)).A053722
Number of n X n binary matrices of order dividing 2 (also number of solutions to X^2=I in GL(n,2)).
- Number of 5-core partitions of n.A053723
Number of 5-core partitions of n.
- Number of 7-core partitions of n.A053724
Number of 7-core partitions of n.
- Number of n X n binary matrices of order dividing 3 (also number of solutions to X^3=I in GL(n,2)).A053725
Number of n X n binary matrices of order dividing 3 (also number of solutions to X^3=I in GL(n,2)).
- "Flag numbers": number of dots that can be arranged in successive rows of K, K-1, K, K-1, K, ..., K-1, K (assuming there is a total of L > 1 rows of size K > 1).A053726
"Flag numbers": number of dots that can be arranged in successive rows of K, K-1, K, K-1, K, ..., K-1, K (assuming there is a total of L > 1 rows of size K > 1).
- Triangle T(n,k) = Sum_{d|gcd(n,k)} mu(d)*C(n/d,k/d) (n >= 1, 1 <= k <= n).A053727
Triangle T(n,k) = Sum_{d|gcd(n,k)} mu(d)*C(n/d,k/d) (n >= 1, 1 <= k <= n).
- For n=1,2,3,..., compute sum of aliquot divisors of n; if result is prime append this prime to sequence.A053728
For n=1,2,3,..., compute sum of aliquot divisors of n; if result is prime append this prime to sequence.
- Self-convolution of 1,4,27,256,3125,46656,... (cf. A000312).A053729
Self-convolution of 1,4,27,256,3125,46656,... (cf. A000312).
- a(n) = 2^(n-2)*(n^2 - n + 4).A053730
a(n) = 2^(n-2)*(n^2 - n + 4).
- a(n) = ceiling(binomial(n,8)/n).A053731
a(n) = ceiling(binomial(n,8)/n).
- Number of ways to partition {1,...,n} into arithmetic progressions of length >= 1.A053732
Number of ways to partition {1,...,n} into arithmetic progressions of length >= 1.
- a(n) = ceiling(binomial(n,9)/n).A053733
a(n) = ceiling(binomial(n,9)/n).
- A000016-A000048 (when they are lined up so that the two 16's match).A053734
A000016-A000048 (when they are lined up so that the two 16's match).
- Sum of digits of (n written in base 3).A053735
Sum of digits of (n written in base 3).
- Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.A053736
Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.
- Sum of digits of (n written in base 4).A053737
Sum of digits of (n written in base 4).
- If k is in sequence then 2*k and 2*k+1 are not (and 1 is in the sequence); numbers with an odd number of digits in binary.A053738
If k is in sequence then 2*k and 2*k+1 are not (and 1 is in the sequence); numbers with an odd number of digits in binary.
- Partial sums of A014166.A053739
Partial sums of A014166.
- Number of prime triangle partitions of order n.A053740
Number of prime triangle partitions of order n.
- Sum of even numbers in range 10*n to 10*n+9.A053741
Sum of even numbers in range 10*n to 10*n+9.
- Sum of odd numbers in range 10*n to 10*n+9.A053742
Sum of odd numbers in range 10*n to 10*n+9.
- Sum of numbers in range 10*n to 10*n+9.A053743
Sum of numbers in range 10*n to 10*n+9.
- Sum of 3 consecutive digits of Pi.A053744
Sum of 3 consecutive digits of Pi.
- Positions of '1's in the decimal expansion of Pi (where positions 1,2,3,... refer to the digits 3,1,4,...).A053745
Positions of '1's in the decimal expansion of Pi (where positions 1,2,3,... refer to the digits 3,1,4,...).
- Positions of '2's in the decimal expansion of Pi, where positions 1, 2, 3, ... correspond to digits 3, 1, 4, ...A053746
Positions of '2's in the decimal expansion of Pi, where positions 1, 2, 3, ... correspond to digits 3, 1, 4, ...
- Positions of 3's in the decimal expansion of Pi.A053747
Positions of 3's in the decimal expansion of Pi.
- Positions of 4's in the decimal expansion of Pi.A053748
Positions of 4's in the decimal expansion of Pi.
- Positions of 5's in the decimal expansion of Pi.A053749
Positions of 5's in the decimal expansion of Pi.
- Positions of 6's in the decimal expansion of Pi.A053750
Positions of 6's in the decimal expansion of Pi.
- Positions of 7's in the decimal expansion of Pi.A053751
Positions of 7's in the decimal expansion of Pi.
- Positions of 8's in the decimal expansion of Pi.A053752
Positions of 8's in the decimal expansion of Pi.
- Positions of 9's in the decimal expansion of Pi.A053753
Positions of 9's in the decimal expansion of Pi.
- If k is in the sequence then 2*k and 2*k+1 are not (and 0 is in the sequence); when written in binary k has an even number of bits (0 has 0 digits).A053754
If k is in the sequence then 2*k and 2*k+1 are not (and 0 is in the sequence); when written in binary k has an even number of bits (0 has 0 digits).
- a(n) = 4*n^2 + 1.A053755
a(n) = 4*n^2 + 1.
- a(n)=a(a(n-3))+a(n-a(n-3)) if n>2 otherwise a(n)=1.A053756
a(n)=a(a(n-3))+a(n-a(n-3)) if n>2 otherwise a(n)=1.
- a(n) = a(a(n-4))+a(n-a(n-4)) if n>2 otherwise a(n)=1.A053757
a(n) = a(a(n-4))+a(n-a(n-4)) if n>2 otherwise a(n)=1.
- a(n) = a(a(n-5))+a(n-a(n-5)) if n>2 otherwise a(n)=1.A053758
a(n) = a(a(n-5))+a(n-a(n-5)) if n>2 otherwise a(n)=1.
- a(n) = a(a(n-6))+a(n-a(n-6)) if n>2 otherwise a(n)=1.A053759
a(n) = a(a(n-6))+a(n-a(n-6)) if n>2 otherwise a(n)=1.
- Smallest positive quadratic nonresidue modulo p, where p is the n-th prime.A053760
Smallest positive quadratic nonresidue modulo p, where p is the n-th prime.