Sequences
392,541 sequences
- Number of primes not exceeding square root of n: primepi(sqrt(n)).A056811
Number of primes not exceeding square root of n: primepi(sqrt(n)).
- Number of unitary prime factors of lcm[1..n], i.e., primes in LCM with exponent 1.A056812
Number of unitary prime factors of lcm[1..n], i.e., primes in LCM with exponent 1.
- Largest non-unitary prime factor of LCM(1,...,n); that is, the largest prime which occurs to power > 1 in prime factorization of LCM(1,..,n).A056813
Largest non-unitary prime factor of LCM(1,...,n); that is, the largest prime which occurs to power > 1 in prime factorization of LCM(1,..,n).
- Triangle partitions of order n: topologically distinct ways to dissect a triangle into n triangles.A056814
Triangle partitions of order n: topologically distinct ways to dissect a triangle into n triangles.
- Primes with prime "look and say" descriptions.A056815
Primes with prime "look and say" descriptions.
- Primes in the tribonacci sequence A000213.A056816
Primes in the tribonacci sequence A000213.
- Least inverse of A056796.A056817
Least inverse of A056796.
- A number n is included if n^2 divides n-th term of A056855.A056818
A number n is included if n^2 divides n-th term of A056855.
- a(n) = Product_{k|n} (n+1-k).A056819
a(n) = Product_{k|n} (n+1-k).
- Euler totient function of Cullen numbers (A002064), n*2^n +1.A056820
Euler totient function of Cullen numbers (A002064), n*2^n +1.
- Totient of the Woodall numbers (A003261), n*2^n -1.A056821
Totient of the Woodall numbers (A003261), n*2^n -1.
- Nearest integer to n^2/16.A056822
Nearest integer to n^2/16.
- Number of compositions minus number of partitions: A011782(n) - A000041(n).A056823
Number of compositions minus number of partitions: A011782(n) - A000041(n).
- Numbers of the form p^(2k+1), p prime, k >= 1.A056824
Numbers of the form p^(2k+1), p prime, k >= 1.
- Numbers such that no smaller positive integer has the same maximal palindrome in the periodic part of the simple continued fraction for its square root.A056825
Numbers such that no smaller positive integer has the same maximal palindrome in the periodic part of the simple continued fraction for its square root.
- Primes p such that (p^p + 1)/(p + 1) is a prime.A056826
Primes p such that (p^p + 1)/(p + 1) is a prime.
- a(n) = floor(n^2/6).A056827
a(n) = floor(n^2/6).
- Numbers that are not the sum of at most three powerful numbers (A001694).A056828
Numbers that are not the sum of at most three powerful numbers (A001694).
- Nearest integer to n^2/6.A056829
Nearest integer to n^2/6.
- Alternate digits 1 and 0.A056830
Alternate digits 1 and 0.
- LCM of composite numbers falling between n-th and (n+1)-st primes.A056831
LCM of composite numbers falling between n-th and (n+1)-st primes.
- All a(n) = 1 or 2; a(1) = 1; get next 2^k terms by repeating first 2^k terms and changing last element so sum of first 2^(k+1) terms is odd.A056832
All a(n) = 1 or 2; a(1) = 1; get next 2^k terms by repeating first 2^k terms and changing last element so sum of first 2^(k+1) terms is odd.
- Nearest integer to n^2/7.A056833
Nearest integer to n^2/7.
- a(n) = floor(n^2/7).A056834
a(n) = floor(n^2/7).
- a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.A056835
a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.
- Distinct values of sequence obtained when LCM is applied to initial segments of sequence A024619 union {1}.A056836
Distinct values of sequence obtained when LCM is applied to initial segments of sequence A024619 union {1}.
- Duplicate of A001971.A056837
Duplicate of A001971.
- a(n) = floor(n^2/9).A056838
a(n) = floor(n^2/9).
- Squarefree part of lcm(1,...,n).A056839
Squarefree part of lcm(1,...,n).
- Number of rounded n-celled polyominoes.A056840
Number of rounded n-celled polyominoes.
- Number of diagonal polyominoes with n cells.A056841
Number of diagonal polyominoes with n cells.
- Number of polydrafters: a(n) is the number of polydrafters with n cells.A056842
Number of polydrafters: a(n) is the number of polydrafters with n cells.
- Number of polydudes(1): a(n) is the number of polydudes with n cells. See the first link for the source of this sequence. The definition is unknown. Not the same as A091130.A056843
Number of polydudes(1): a(n) is the number of polydudes with n cells. See the first link for the source of this sequence. The definition is unknown. Not the same as A091130.
- Number of polydiamonds: polyforms made from n diamonds.A056844
Number of polydiamonds: polyforms made from n diamonds.
- Number of distinct connected planar figures that can be formed from n non-overlapping diamonds.A056845
Number of distinct connected planar figures that can be formed from n non-overlapping diamonds.
- Number of polyominoids containing n squares: these are 2-dimensional polyominoes in a three-dimensional grid (edge-connected squares, like the floors, ceilings and walls of a building). Mirror images are distinguished.A056846
Number of polyominoids containing n squares: these are 2-dimensional polyominoes in a three-dimensional grid (edge-connected squares, like the floors, ceilings and walls of a building). Mirror images are distinguished.
- Nearest integer to n - sqrt(n).A056847
Nearest integer to n - sqrt(n).
- Numbers k that divide the number of partitions of k into distinct parts (A000009).A056848
Numbers k that divide the number of partitions of k into distinct parts (A000009).
- Final digit of n^n.A056849
Final digit of n^n.
- Minimal absolute difference of 3^n and 2^k.A056850
Minimal absolute difference of 3^n and 2^k.
- Integers n such that the number of digits in n! is a cube.A056851
Integers n such that the number of digits in n! is a cube.
- a(n) = (p^p + 1)/(p + 1), where p = prime(n).A056852
a(n) = (p^p + 1)/(p + 1), where p = prime(n).
- Numbers n satisfying phi(n+1) - phi(n-1) = 2.A056853
Numbers n satisfying phi(n+1) - phi(n-1) = 2.
- a(n) = Lucas(4*n).A056854
a(n) = Lucas(4*n).
- a(n) = (Product k) * (Sum 1/k), where both the product and the sum are over those positive integers k, where k <= n and gcd(k,n) = 1.A056855
a(n) = (Product k) * (Sum 1/k), where both the product and the sum are over those positive integers k, where k <= n and gcd(k,n) = 1.
- Triangle of numbers related to rooted trees and unrooted planar trees.A056856
Triangle of numbers related to rooted trees and unrooted planar trees.
- Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n.A056857
Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n.
- Triangle of number of rises in restricted growth strings (RGS) for the set partitions of n.A056858
Triangle of number of rises in restricted growth strings (RGS) for the set partitions of n.
- Triangle of number of falls in set partitions of n.A056859
Triangle of number of falls in set partitions of n.
- Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).A056860
Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).