Sequences
392,541 sequences
- Waring's problem: conjectured values for G(n), the smallest number m such that every sufficiently large number is the sum of at most m n-th powers of positive integers.A079611
Waring's problem: conjectured values for G(n), the smallest number m such that every sufficiently large number is the sum of at most m n-th powers of positive integers.
- Largest number m such that a^n == 1 (mod m) whenever a is coprime to m.A079612
Largest number m such that a^n == 1 (mod m) whenever a is coprime to m.
- a(n) = F(3*2^n) where F(k) denotes the k-th Fibonacci number.A079613
a(n) = F(3*2^n) where F(k) denotes the k-th Fibonacci number.
- Decimal expansion of Bertrand's constant.A079614
Decimal expansion of Bertrand's constant.
- Product of all distinct prime factors of all composite numbers between n-th prime and next prime.A079615
Product of all distinct prime factors of all composite numbers between n-th prime and next prime.
- Prime factorization templates.A079616
Prime factorization templates.
- Occurrences of prime factorization templates, unordered.A079617
Occurrences of prime factorization templates, unordered.
- Triangle of coefficients in polynomials for partial sums of powers, scaled to produce integers: Sum_{i=1..m} i^(n-1) = Sum_{k=1..n} T(n,k)*m^k/A064538(n-1).A079618
Triangle of coefficients in polynomials for partial sums of powers, scaled to produce integers: Sum_{i=1..m} i^(n-1) = Sum_{k=1..n} T(n,k)*m^k/A064538(n-1).
- Look at and say the digits of Pi.A079619
Look at and say the digits of Pi.
- Look at and say the digits of e.A079620
Look at and say the digits of e.
- Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).A079621
Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).
- Mersenne primes with prime "look and say" descriptions.A079622
Mersenne primes with prime "look and say" descriptions.
- a(1) = a(2) = 1, a(3)=4, a(n) = abs(a(n-1) - a(n-2) - a(n-3)).A079623
a(1) = a(2) = 1, a(3)=4, a(n) = abs(a(n-1) - a(n-2) - a(n-3)).
- a(1) = a(2) = 1, a(3) = 6, a(n) = abs(a(n-1) - a(n-2) - a(n-3)).A079624
a(1) = a(2) = 1, a(3) = 6, a(n) = abs(a(n-1) - a(n-2) - a(n-3)).
- Marks on lexicographically earliest 22-mark optimal Golomb ruler.A079625
Marks on lexicographically earliest 22-mark optimal Golomb ruler.
- Let u(1) = u(2) = 1, u(n) = abs(u(n-1) - 3/2*u(n-2)); then a(n) is the exponent of 2 in the denominator of u(n).A079626
Let u(1) = u(2) = 1, u(n) = abs(u(n-1) - 3/2*u(n-2)); then a(n) is the exponent of 2 in the denominator of u(n).
- a(n) = Sum_{prime(n) < m < prime(n+1)} mu(m), where mu is the Moebius function (A008683).A079627
a(n) = Sum_{prime(n) < m < prime(n+1)} mu(m), where mu is the Moebius function (A008683).
- Array of coefficients of P(n,x) = det (M(n,x)) where M(n,x) is the n X n matrix m(i,j)=x if i>j m(i,j)=1-x if i<=j.A079628
Array of coefficients of P(n,x) = det (M(n,x)) where M(n,x) is the n X n matrix m(i,j)=x if i>j m(i,j)=1-x if i<=j.
- Number of twin prime pairs between p^2 and q^2 where (p,q) is the n-th twin prime pair.A079629
Number of twin prime pairs between p^2 and q^2 where (p,q) is the n-th twin prime pair.
- Numbers n such that |real(zeta(1/2 + n*I))| exceeds all previous values, where zeta is the Riemann zeta function.A079630
Numbers n such that |real(zeta(1/2 + n*I))| exceeds all previous values, where zeta is the Riemann zeta function.
- Number of k less than or equal to n such that floor(k^(1/3)) divides k.A079631
Number of k less than or equal to n such that floor(k^(1/3)) divides k.
- a(n) = floor(n/floor(sqrt(n)))-floor(sqrt(n)).A079632
a(n) = floor(n/floor(sqrt(n)))-floor(sqrt(n)).
- a(n) = floor(n/floor(n^(1/3))) - floor(n^(2/3)).A079633
a(n) = floor(n/floor(n^(1/3))) - floor(n^(2/3)).
- Marks on lexicographically earliest 23-mark optimal Golomb ruler.A079634
Marks on lexicographically earliest 23-mark optimal Golomb ruler.
- Sum of (2 - p mod 4) for all prime factors p of n (with repetition).A079635
Sum of (2 - p mod 4) for all prime factors p of n (with repetition).
- Smallest number whose reciprocal fits in the square-root gap of consecutive primes.A079636
Smallest number whose reciprocal fits in the square-root gap of consecutive primes.
- Smallest prime p with audioactive "echo" of at least n, that is, the finite sequence p_0 = p, p_1 = LookAndSay(p_0), ..., p_n = LookAndSay(p_(n-1)) consists entirely of primes.A079637
Smallest prime p with audioactive "echo" of at least n, that is, the finite sequence p_0 = p, p_1 = LookAndSay(p_0), ..., p_n = LookAndSay(p_(n-1)) consists entirely of primes.
- Matrix product of unsigned Lah-triangle |A008297(n,k)| and unsigned Stirling1-triangle |A008275(n,k)|.A079638
Matrix product of unsigned Lah-triangle |A008297(n,k)| and unsigned Stirling1-triangle |A008275(n,k)|.
- Matrix product of Stirling1-triangle A008275(n,k) and unsigned Lah-triangle |A008297(n,k)|.A079639
Matrix product of Stirling1-triangle A008275(n,k) and unsigned Lah-triangle |A008297(n,k)|.
- Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and unsigned Lah-triangle |A008297(n,k)|.A079640
Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and unsigned Lah-triangle |A008297(n,k)|.
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.A079641
Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.
- Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and Stirling1-triangle A008275(n,k).A079642
Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and Stirling1-triangle A008275(n,k).
- a(n) = floor(n/floor(sqrt(n))).A079643
a(n) = floor(n/floor(sqrt(n))).
- a(n) = (n mod sqrtint(n)).A079644
a(n) = (n mod sqrtint(n)).
- Numbers j such that the integer part of the cube root of j divides j.A079645
Numbers j such that the integer part of the cube root of j divides j.
- A congruence property: a(n) = (A248586(p)-5)/(4*p) where p is the n-th prime.A079646
A congruence property: a(n) = (A248586(p)-5)/(4*p) where p is the n-th prime.
- Integer part of the cube root of n and integer part of the square root of n both divide n.A079647
Integer part of the cube root of n and integer part of the square root of n both divide n.
- Number of primes between n^2 and n^3.A079648
Number of primes between n^2 and n^3.
- Numbers k such that k! + k^2 + k + 1 is prime.A079649
Numbers k such that k! + k^2 + k + 1 is prime.
- Continued fraction for e^(-gamma).A079650
Continued fraction for e^(-gamma).
- Primes having only {1, 4, 7} as digits.A079651
Primes having only {1, 4, 7} as digits.
- Prime numbers using only the curved digits 0, 3, 6, 8 and 9.A079652
Prime numbers using only the curved digits 0, 3, 6, 8 and 9.
- Triangular numbers using only the curved digits 0, 3, 6, 8 and 9.A079653
Triangular numbers using only the curved digits 0, 3, 6, 8 and 9.
- Triangular numbers using only the straight digits 1, 4 and 7.A079654
Triangular numbers using only the straight digits 1, 4 and 7.
- Perfect squares using only the curved digits 0, 3, 6, 8 and 9.A079655
Perfect squares using only the curved digits 0, 3, 6, 8 and 9.
- Cubes using only the digits 0, 3, 6, 8 and 9.A079656
Cubes using only the digits 0, 3, 6, 8 and 9.
- Fibonacci numbers using only the curved digits 0, 3, 6, 8 and 9.A079657
Fibonacci numbers using only the curved digits 0, 3, 6, 8 and 9.
- Fibonacci numbers using only the straight digits 1, 4 and 7.A079658
Fibonacci numbers using only the straight digits 1, 4 and 7.
- Nonunit step integers of double-loop digraphs.A079659
Nonunit step integers of double-loop digraphs.
- Determinant of the n X n matrix m(i,j)=C(i+j,abs(i-j)).A079660
Determinant of the n X n matrix m(i,j)=C(i+j,abs(i-j)).