Sequences
392,541 sequences
- Numbers n such that n^2 + n + 41 (known as Euler's polynomial) is prime.A056561
Numbers n such that n^2 + n + 41 (known as Euler's polynomial) is prime.
- Number of primes which are the difference between two triangular numbers, where the smaller is the n-th triangular number.A056562
Number of primes which are the difference between two triangular numbers, where the smaller is the n-th triangular number.
- Number of primes which are the difference between two triangular numbers, where the larger is the n-th triangular number.A056563
Number of primes which are the difference between two triangular numbers, where the larger is the n-th triangular number.
- Number of times primes can be produced by taking the absolute difference between the n-th triangular number and another triangular number.A056564
Number of times primes can be produced by taking the absolute difference between the n-th triangular number and another triangular number.
- Fibonomial coefficients.A056565
Fibonomial coefficients.
- Fibonomial coefficients.A056566
Fibonomial coefficients.
- Fibonomial coefficients.A056567
Fibonomial coefficients.
- Fibonomial coefficients.A056568
Fibonomial coefficients.
- Row sums of Fibonomial triangle A010048.A056569
Row sums of Fibonomial triangle A010048.
- Third power of Fibonacci numbers (A000045).A056570
Third power of Fibonacci numbers (A000045).
- Fourth power of Fibonacci numbers A000045.A056571
Fourth power of Fibonacci numbers A000045.
- Fifth power of Fibonacci numbers A000045.A056572
Fifth power of Fibonacci numbers A000045.
- Sixth power of Fibonacci numbers A000045.A056573
Sixth power of Fibonacci numbers A000045.
- Seventh power of Fibonacci numbers A000045.A056574
Seventh power of Fibonacci numbers A000045.
- Series for first parallel moment of square lattice bond percolation near a wall.A056575
Series for first parallel moment of square lattice bond percolation near a wall.
- Highest k with 2^k <= 3^n.A056576
Highest k with 2^k <= 3^n.
- Difference between 3^n and highest power of 2 less than or equal to 3^n.A056577
Difference between 3^n and highest power of 2 less than or equal to 3^n.
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3.A056578
a(n) = 1 + 2*n + 3*n^2 + 4*n^3.
- 1+2n+3n^2+4n^3+5n^4.A056579
1+2n+3n^2+4n^3+5n^4.
- a(n) = round(e^(Pi*sqrt(n))).A056580
a(n) = round(e^(Pi*sqrt(n))).
- Nearest integer to 1/(A056580(n) - exp(sqrt(n)*Pi)).A056581
Nearest integer to 1/(A056580(n) - exp(sqrt(n)*Pi)).
- Highest common factor (or GCD) of n^n and hyperfactorial(n-1), i.e., gcd(n^n, product(k^k) for k < n).A056582
Highest common factor (or GCD) of n^n and hyperfactorial(n-1), i.e., gcd(n^n, product(k^k) for k < n).
- Solution to a(n)^(n^2/a(n)) = gcd(n^n, Product_{k<n} k^k) where a(n) and n^2/a(n) are integers, or 0 if no such integers exist.A056583
Solution to a(n)^(n^2/a(n)) = gcd(n^n, Product_{k<n} k^k) where a(n) and n^2/a(n) are integers, or 0 if no such integers exist.
- Solution to (n^2/a(n))^a(n) = gcd(n^n, Product_{k<n} k^k) where a(n) and n^2/a(n) are integers, or 0 if no such integers exist.A056584
Solution to (n^2/a(n))^a(n) = gcd(n^n, Product_{k<n} k^k) where a(n) and n^2/a(n) are integers, or 0 if no such integers exist.
- Eighth power of Fibonacci numbers A000045.A056585
Eighth power of Fibonacci numbers A000045.
- Ninth power of Fibonacci numbers A000045.A056586
Ninth power of Fibonacci numbers A000045.
- Tenth power of Fibonacci numbers A000045.A056587
Tenth power of Fibonacci numbers A000045.
- Coefficient triangle of certain polynomials.A056588
Coefficient triangle of certain polynomials.
- Third column sequence of unsigned triangle A056588.A056589
Third column sequence of unsigned triangle A056588.
- Fourth column sequence of triangle A056588.A056590
Fourth column sequence of triangle A056588.
- Fifth column sequence of triangle A056588.A056591
Fifth column sequence of triangle A056588.
- Row sums of signed triangle A056588.A056592
Row sums of signed triangle A056588.
- Row sums of unsigned triangle A056588.A056593
Row sums of unsigned triangle A056588.
- Period 4: repeat [1,0,-1,0]; expansion of 1/(1 + x^2).A056594
Period 4: repeat [1,0,-1,0]; expansion of 1/(1 + x^2).
- Number of nonsquare divisors of n.A056595
Number of nonsquare divisors of n.
- Number of nonsquare divisors of n!.A056596
Number of nonsquare divisors of n!.
- Number of letters in n in Serbian or Croatian.A056597
Number of letters in n in Serbian or Croatian.
- Series for 2nd parallel moment of square lattice bond percolation near a wall (eventually goes negative).A056598
Series for 2nd parallel moment of square lattice bond percolation near a wall (eventually goes negative).
- Series for first perpendicular moment of square lattice bond percolation near a wall (eventually goes negative).A056599
Series for first perpendicular moment of square lattice bond percolation near a wall (eventually goes negative).
- a(n) is smallest number A such that there is an equality of the form (A=Product of n distinct primes) = (B=Product of n distinct primes) + (C=Product of n distinct primes) with gcd(A,B) = gcd(B,C) = gcd(A,C) = 1, B < C.A056600
a(n) is smallest number A such that there is an equality of the form (A=Product of n distinct primes) = (B=Product of n distinct primes) + (C=Product of n distinct primes) with gcd(A,B) = gcd(B,C) = gcd(A,C) = 1, B < C.
- Series for 2nd perpendicular moment of square lattice bond percolation near a wall (eventually goes negative).A056601
Series for 2nd perpendicular moment of square lattice bond percolation near a wall (eventually goes negative).
- Numbers A such that there is an equation of the form (A = Product of m + 1 primes) = (B = Product of m primes) + (C = Product of m primes), where A*B*C is a primorial number (A002110).A056602
Numbers A such that there is an equation of the form (A = Product of m + 1 primes) = (B = Product of m primes) + (C = Product of m primes), where A*B*C is a primorial number (A002110).
- Squarefree kernels of distinct values of lcm(1,...,m) (A051451).A056603
Squarefree kernels of distinct values of lcm(1,...,m) (A051451).
- a(0)=1; thereafter a(n) = lcm(1, 2, 3, 4, ..., prime(n)).A056604
a(0)=1; thereafter a(n) = lcm(1, 2, 3, 4, ..., prime(n)).
- Number of stable n-celled patterns ("still lifes") in Conway's game of Life (incorrect version).A056605
Number of stable n-celled patterns ("still lifes") in Conway's game of Life (incorrect version).
- Squarefree kernel of lcm(binomial(n,0), ..., binomial(n,n)).A056606
Squarefree kernel of lcm(binomial(n,0), ..., binomial(n,n)).
- a(n) is the n-th primorial divided by squarefree kernel of corresponding central binomial coefficient.A056607
a(n) is the n-th primorial divided by squarefree kernel of corresponding central binomial coefficient.
- Least prime factor of the n-th composite number.A056608
Least prime factor of the n-th composite number.
- a(n) = rad(n!)/rad(A001142(n)) where rad(n) is the squarefree kernel of n, A007947(n).A056609
a(n) = rad(n!)/rad(A001142(n)) where rad(n) is the squarefree kernel of n, A007947(n).
- Quotient: squarefree kernel of lcm(1,..,n) (or of n!) divided by kernel of central binomial coefficient.A056610
Quotient: squarefree kernel of lcm(1,..,n) (or of n!) divided by kernel of central binomial coefficient.