Sequences
392,541 sequences
- Odd squarefree numbers.A056911
Odd squarefree numbers.
- Odd squarefree numbers for which the number of prime divisors is odd.A056912
Odd squarefree numbers for which the number of prime divisors is odd.
- Odd squarefree numbers for which the number of prime divisors is even.A056913
Odd squarefree numbers for which the number of prime divisors is even.
- a(n) = Lucas(4*n+1).A056914
a(n) = Lucas(4*n+1).
- Strong pseudoprimes to bases 2, 3 and 5, i.e., intersection of A001262, A020229, and A020231.A056915
Strong pseudoprimes to bases 2, 3 and 5, i.e., intersection of A001262, A020229, and A020231.
- Product of the orders of the elements in a cyclic group with n elements.A056916
Product of the orders of the elements in a cyclic group with n elements.
- Numbers n such that sigma(n)-phi(n) is a perfect square.A056917
Numbers n such that sigma(n)-phi(n) is a perfect square.
- a(n) = 9*a(n-1)-a(n-2); a(0)=2, a(1)=9.A056918
a(n) = 9*a(n-1)-a(n-2); a(0)=2, a(1)=9.
- Numerators of continued fraction for left factorial.A056919
Numerators of continued fraction for left factorial.
- Denominators of continued fraction for left factorial.A056920
Denominators of continued fraction for left factorial.
- a(0) = 0, a(1) = 1, a(2*n) = n*a(2*n-1) + a(2*n-2), a(2*n+1) = a(2*n) + a(2*n-1).A056921
a(0) = 0, a(1) = 1, a(2*n) = n*a(2*n-1) + a(2*n-2), a(2*n+1) = a(2*n) + a(2*n-1).
- Denominators of continued fraction for alternating factorial.A056922
Denominators of continued fraction for alternating factorial.
- Write the integers in groups: 0; 1,2; 3,4,5; 6,7,8,9; ... and form the product of the members of each group.A056923
Write the integers in groups: 0; 1,2; 3,4,5; 6,7,8,9; ... and form the product of the members of each group.
- Number of divisors of n that are smaller than sqrt(n).A056924
Number of divisors of n that are smaller than sqrt(n).
- Largest integer power of n which divides product of divisors of n.A056925
Largest integer power of n which divides product of divisors of n.
- a(n) = sqrt(n) if n is a square, otherwise 1.A056926
a(n) = sqrt(n) if n is a square, otherwise 1.
- Difference between n^2 and largest prime less than n^2.A056927
Difference between n^2 and largest prime less than n^2.
- Average of the smallest prime greater than n^2 and the largest prime less than n^2.A056928
Average of the smallest prime greater than n^2 and the largest prime less than n^2.
- Difference between n^2 and average of smallest prime greater than n^2 and largest prime less than n^2.A056929
Difference between n^2 and average of smallest prime greater than n^2 and largest prime less than n^2.
- Average of smallest prime greater than n^2 and largest prime less than (n+1)^2.A056930
Average of smallest prime greater than n^2 and largest prime less than (n+1)^2.
- Difference between n-th oblong (promic) number, n(n+1), and the average of the smallest prime greater than n^2 and the largest prime less than (n+1)^2.A056931
Difference between n-th oblong (promic) number, n(n+1), and the average of the smallest prime greater than n^2 and the largest prime less than (n+1)^2.
- Antichains (or order ideals) in the poset 2*2*2*n or size of the distributive lattice J(2*2*2*n).A056932
Antichains (or order ideals) in the poset 2*2*2*n or size of the distributive lattice J(2*2*2*n).
- Antichains (or order ideals) in the poset 2*2*6*n or size of the distributive lattice J(2*2*6*n).A056933
Antichains (or order ideals) in the poset 2*2*6*n or size of the distributive lattice J(2*2*6*n).
- Antichains (or order ideals) in the poset 2*2*7*n or size of the distributive lattice J(2*2*7*n).A056934
Antichains (or order ideals) in the poset 2*2*7*n or size of the distributive lattice J(2*2*7*n).
- Antichains (or order ideals) in the poset 2*3*3*n or size of the distributive lattice J(2*3*3*n).A056935
Antichains (or order ideals) in the poset 2*3*3*n or size of the distributive lattice J(2*3*3*n).
- Antichains (or order ideals) in the poset 2*3*4*n or size of the distributive lattice J(2*3*4*n).A056936
Antichains (or order ideals) in the poset 2*3*4*n or size of the distributive lattice J(2*3*4*n).
- Number of antichains (or order ideals) in the poset 3*3*3*n or size of the distributive lattice J(3*3*3*n).A056937
Number of antichains (or order ideals) in the poset 3*3*3*n or size of the distributive lattice J(3*3*3*n).
- Concatenate all the prime divisors in previous term (with repetition), starting at 49.A056938
Concatenate all the prime divisors in previous term (with repetition), starting at 49.
- Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.A056939
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.
- Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.A056940
Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.
- Number of antichains (or order ideals) in the poset 5*m*n or plane partitions with not more than m rows, n columns and entries <= 5.A056941
Number of antichains (or order ideals) in the poset 5*m*n or plane partitions with not more than m rows, n columns and entries <= 5.
- Area of rectangle needed to enclose a non-touching spiral of length n on a square lattice.A056942
Area of rectangle needed to enclose a non-touching spiral of length n on a square lattice.
- Unused area of rectangle needed to enclose a non-touching spiral of length n on a square lattice.A056943
Unused area of rectangle needed to enclose a non-touching spiral of length n on a square lattice.
- Amount by which used area of rectangle needed to enclose a non-touching spiral of length n on a square lattice exceeds unused area.A056944
Amount by which used area of rectangle needed to enclose a non-touching spiral of length n on a square lattice exceeds unused area.
- Jacobi form of weight 12 and index 1 associated to a (nonexistent) lattice vector of norm 2 for the Leech lattice.A056945
Jacobi form of weight 12 and index 1 associated to a (nonexistent) lattice vector of norm 2 for the Leech lattice.
- Coefficients of J(0)*theta_3(z) where J(0) is sequence A056945.A056946
Coefficients of J(0)*theta_3(z) where J(0) is sequence A056945.
- Theta series of nonexistent Niemeier lattice of Coxeter number 1.A056947
Theta series of nonexistent Niemeier lattice of Coxeter number 1.
- Jacobi form of weight 12 and index 1 associated with a nonexistent Niemeier lattice of Coxeter number 1.A056948
Jacobi form of weight 12 and index 1 associated with a nonexistent Niemeier lattice of Coxeter number 1.
- J(1)*theta3(z) where J(1) is the series given by A056948.A056949
J(1)*theta3(z) where J(1) is the series given by A056948.
- Jacobi form of weight 12 and index 1 associated with a nonexistent Niemeier lattice of Coxeter number 11.A056950
Jacobi form of weight 12 and index 1 associated with a nonexistent Niemeier lattice of Coxeter number 11.
- Triangle whose rows show the result of flipping the first, first two, ... and finally first n coins when starting with the stack (1,2,3,4,...,n) [starting with all heads up, where signs show whether particular coins end up heads or tails].A056951
Triangle whose rows show the result of flipping the first, first two, ... and finally first n coins when starting with the stack (1,2,3,4,...,n) [starting with all heads up, where signs show whether particular coins end up heads or tails].
- Numerators of continued fraction for alternating factorial.A056952
Numerators of continued fraction for alternating factorial.
- Denominators of continued fraction for alternating factorial.A056953
Denominators of continued fraction for alternating factorial.
- Numbers k such that k^2 divides A056819(k).A056954
Numbers k such that k^2 divides A056819(k).
- Euclid set of class 2 and modulus 3.A056955
Euclid set of class 2 and modulus 3.
- Numbers n such that 6n+1 and 6n+5 are both primes.A056956
Numbers n such that 6n+1 and 6n+5 are both primes.
- In repeated iterations of function m->m/2 if m even, m->3m-1 if m odd, a(n) is minimum value achieved if starting from n.A056957
In repeated iterations of function m->m/2 if m even, m->3m-1 if m odd, a(n) is minimum value achieved if starting from n.
- Number of days in months of Coptic calendar.A056958
Number of days in months of Coptic calendar.
- In repeated iterations of function m -> m/2 if m even, m -> 3m+1 if m odd, a(n) is maximum value achieved if starting from n.A056959
In repeated iterations of function m -> m/2 if m even, m -> 3m+1 if m odd, a(n) is maximum value achieved if starting from n.
- Base 11 reversal of n (written in base 10).A056960
Base 11 reversal of n (written in base 10).