Sequences
392,541 sequences
- Hypotenuses of primitive Pythagorean triangles sorted on product of sides.A088511
Hypotenuses of primitive Pythagorean triangles sorted on product of sides.
- Number of partitions of n into two parts whose xor-sum is n.A088512
Number of partitions of n into two parts whose xor-sum is n.
- Smallest cevians corresponding to A089025(n).A088513
Smallest cevians corresponding to A089025(n).
- Smaller section of edge A089025(n) by integral cevian A088513(n).A088514
Smaller section of edge A089025(n) by integral cevian A088513(n).
- Values j of pairs (j,k) that generate A088319(n).A088515
Values j of pairs (j,k) that generate A088319(n).
- Values k of pairs (j,k) that generate A088319(n).A088516
Values k of pairs (j,k) that generate A088319(n).
- First differences of Golomb's sequence.A088517
First differences of Golomb's sequence.
- Symmetric secondary structures of RNA molecules with n nucleotides.A088518
Symmetric secondary structures of RNA molecules with n nucleotides.
- 2-Golomb's sequence G(n,2): earliest positive increasing sequence starting with (1,2) and satisfying "length of n-th run = n-th partial sum".A088519
2-Golomb's sequence G(n,2): earliest positive increasing sequence starting with (1,2) and satisfying "length of n-th run = n-th partial sum".
- Permutation of natural numbers generated by 3-rowed array shown below.A088520
Permutation of natural numbers generated by 3-rowed array shown below.
- a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).A088521
a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).
- a(1) = 2; for n > 1, a(n) = (a(n-1) + n) mod prime(n).A088522
a(1) = 2; for n > 1, a(n) = (a(n-1) + n) mod prime(n).
- a(1) = 2; for n > 1, a(n) = (a(n-1) + prime(n)) mod n.A088523
a(1) = 2; for n > 1, a(n) = (a(n-1) + prime(n)) mod n.
- Greatest twin prime that does not exceed n (starting at n=3).A088524
Greatest twin prime that does not exceed n (starting at n=3).
- Duplicate of A054735.A088525
Duplicate of A054735.
- a(n) = A061017(n) - pi(n) - 1.A088526
a(n) = A061017(n) - pi(n) - 1.
- Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.A088527
Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.
- Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0.A088528
Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0.
- Numerator of Bigomega(n)/Omega(n).A088529
Numerator of Bigomega(n)/Omega(n).
- Denominator of bigomega(n)/omega(n).A088530
Denominator of bigomega(n)/omega(n).
- Numerator of bigomega(n!)/omega(n!).A088531
Numerator of bigomega(n!)/omega(n!).
- "Patterns of permutations": Define the "pattern" formed by k positions in a permutation to be the permutation of {1..k} specifying the relative order of the elements in those positions; a(n) = largest number of different patterns that can occur in a permutation of n letters.A088532
"Patterns of permutations": Define the "pattern" formed by k positions in a permutation to be the permutation of {1..k} specifying the relative order of the elements in those positions; a(n) = largest number of different patterns that can occur in a permutation of n letters.
- Numbers k such that bigomega(k!)/omega(k!) is an integer.A088533
Numbers k such that bigomega(k!)/omega(k!) is an integer.
- Number of representations of n by the quadratic form x^2 + xy + y^2 with 0 <= x <= y.A088534
Number of representations of n by the quadratic form x^2 + xy + y^2 with 0 <= x <= y.
- n representable as x^2+xy+y^2 and such that 3 divides sigma(n).A088535
n representable as x^2+xy+y^2 and such that 3 divides sigma(n).
- Number of unimodal functions [1..n]->[1..n].A088536
Number of unimodal functions [1..n]->[1..n].
- Decimal expansion of Madelung's constant M2.A088537
Decimal expansion of Madelung's constant M2.
- Decimal expansion of 4/Pi.A088538
Decimal expansion of 4/Pi.
- Decimal expansion of (4K/Pi)^2 where K is the Landau-Ramanujan constant.A088539
Decimal expansion of (4K/Pi)^2 where K is the Landau-Ramanujan constant.
- Decimal expansion of (4/sqrt(Pi))*exp(-gamma/2)*K where K is the Landau-Ramanujan constant and gamma the Euler-Mascheroni constant.A088540
Decimal expansion of (4/sqrt(Pi))*exp(-gamma/2)*K where K is the Landau-Ramanujan constant and gamma the Euler-Mascheroni constant.
- Decimal expansion of sqrt(Pi)/(2K)*exp(-gamma/2) where K is the Landau-Ramanujan constant and gamma the Euler-Mascheroni constant.A088541
Decimal expansion of sqrt(Pi)/(2K)*exp(-gamma/2) where K is the Landau-Ramanujan constant and gamma the Euler-Mascheroni constant.
- Prime numbers p such that A022559(p) is a multiple of A000720(p).A088542
Prime numbers p such that A022559(p) is a multiple of A000720(p).
- Decimal expansion of sqrt(15)/2.A088543
Decimal expansion of sqrt(15)/2.
- Scale factor by which primitive Pythagorean triangle {x=A088509(n), y=A088510(n), z=A088511(n)} needs be enlarged in order to circumscribe the smallest integral square having a side on the hypotenuse.A088544
Scale factor by which primitive Pythagorean triangle {x=A088509(n), y=A088510(n), z=A088511(n)} needs be enlarged in order to circumscribe the smallest integral square having a side on the hypotenuse.
- Quotient Fibonacci(5*n)/(5*Fibonacci(n)), where Fibonacci(n) = A000045(n).A088545
Quotient Fibonacci(5*n)/(5*Fibonacci(n)), where Fibonacci(n) = A000045(n).
- Square root of sum of legs of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.A088546
Square root of sum of legs of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.
- Primes of the form x^3+x^2+x+2.A088547
Primes of the form x^3+x^2+x+2.
- Primes of the form k^4 + k^3 + k^2 + k + 1.A088548
Primes of the form k^4 + k^3 + k^2 + k + 1.
- Primes of the form x^5 + x^4 + x^3 + x^2 + x + 2.A088549
Primes of the form x^5 + x^4 + x^3 + x^2 + x + 2.
- Primes of the form n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.A088550
Primes of the form n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.
- Fibonacci winding number: the number of 'mod n' operations in one cycle of the Fibonacci sequence modulo n.A088551
Fibonacci winding number: the number of 'mod n' operations in one cycle of the Fibonacci sequence modulo n.
- Duplicate of A000668.A088552
Duplicate of A000668.
- Primes of the form (3^k-1)/2 or (3^k+1)/2.A088553
Primes of the form (3^k-1)/2 or (3^k+1)/2.
- Primes of the form (5^k-1)/4 or (5^k+3)/4.A088554
Primes of the form (5^k-1)/4 or (5^k+3)/4.
- Primes of the form 5*p + 6 where p is a prime.A088555
Primes of the form 5*p + 6 where p is a prime.
- Numbers of the form (4^n + 4^(n-1) + ... + 1) + (n mod 2).A088556
Numbers of the form (4^n + 4^(n-1) + ... + 1) + (n mod 2).
- Least even leg of primitive Pythagorean triangles with odd leg 2n+1.A088557
Least even leg of primitive Pythagorean triangles with odd leg 2n+1.
- Least odd leg of primitive Pythagorean triangles with even leg 4n.A088558
Least odd leg of primitive Pythagorean triangles with even leg 4n.
- Decimal expansion of R^2 where R^2 is the real root of x^3 + 2*x^2 + x - 1 = 0.A088559
Decimal expansion of R^2 where R^2 is the real root of x^3 + 2*x^2 + x - 1 = 0.
- Sum of odd entries in row n of Pascal's triangle.A088560
Sum of odd entries in row n of Pascal's triangle.