Sequences
392,541 sequences
- Number of 7's in decimal expansion of Fibonacci(n).A085861
Number of 7's in decimal expansion of Fibonacci(n).
- Number of 8's in decimal expansion of Fibonacci(n).A085862
Number of 8's in decimal expansion of Fibonacci(n).
- Number of 9's in decimal expansion of Fibonacci(n).A085863
Number of 9's in decimal expansion of Fibonacci(n).
- a(1) = 2, a(n+1) = a(n)*{tau(a(n))}.A085864
a(1) = 2, a(n+1) = a(n)*{tau(a(n))}.
- a(1) = 2, a(n+1) = a(n)*{sigma(a(n))}, where sigma(n) is the sum of the divisors function.A085865
a(1) = 2, a(n+1) = a(n)*{sigma(a(n))}, where sigma(n) is the sum of the divisors function.
- a(1) = 3, a(n+1) = a(n)*phi(a(n)), where phi(n) is Euler's totient function.A085866
a(1) = 3, a(n+1) = a(n)*phi(a(n)), where phi(n) is Euler's totient function.
- Smallest nontrivial (not = 10^(n-1)) n-digit 7-smooth number. Or smallest n-digit number > 10^(n-1) with prime divisors < 10.A085867
Smallest nontrivial (not = 10^(n-1)) n-digit 7-smooth number. Or smallest n-digit number > 10^(n-1) with prime divisors < 10.
- Largest n-digit 7-smooth number. Or largest n-digit number with prime divisors < 10.A085868
Largest n-digit 7-smooth number. Or largest n-digit number with prime divisors < 10.
- Numbers n such that n and its digit reversal have the same prime signature.A085869
Numbers n such that n and its digit reversal have the same prime signature.
- Array defined by T(i,1)=2^i-1, T(1,j)=2^j-1, T(i,j)=T(i-1,j)+T(i-1,j-1) read by antidiagonals.A085870
Array defined by T(i,1)=2^i-1, T(1,j)=2^j-1, T(i,j)=T(i-1,j)+T(i-1,j-1) read by antidiagonals.
- a(1) = 2, a(2n) = smallest prime of the form k*a(2n-1) +1, k >1, a(2n+1) = smallest prime of the form r*a(2n)-1, r >1.A085871
a(1) = 2, a(2n) = smallest prime of the form k*a(2n-1) +1, k >1, a(2n+1) = smallest prime of the form r*a(2n)-1, r >1.
- a(1) = 2, a(2n) = smallest prime of the form k*a(2n-1) -1, k >1, a(2n+1) = smallest prime of the form r*a(2n)+1, r >1.A085872
a(1) = 2, a(2n) = smallest prime of the form k*a(2n-1) -1, k >1, a(2n+1) = smallest prime of the form r*a(2n)+1, r >1.
- a(1) = 2; a(n)= smallest prime of the form k*a(n-1) + 1 where k itself is a multiple of n.A085873
a(1) = 2; a(n)= smallest prime of the form k*a(n-1) + 1 where k itself is a multiple of n.
- a(1) = 2, a(n)= smallest prime of the form k*a(n-1) - 1 where k itself is a multiple of n.A085874
a(1) = 2, a(n)= smallest prime of the form k*a(n-1) - 1 where k itself is a multiple of n.
- Rearrangement of natural numbers as follows: a(1) = 1, a(2) =2, a(n+1) = smallest number not included earlier such that a(n-1)*a(n) + a(n+1) is a prime.A085875
Rearrangement of natural numbers as follows: a(1) = 1, a(2) =2, a(n+1) = smallest number not included earlier such that a(n-1)*a(n) + a(n+1) is a prime.
- Smallest k such that k and k+n have the same prime signature that is different from all previous terms.A085876
Smallest k such that k and k+n have the same prime signature that is different from all previous terms.
- Smallest square k^2 == 1 (mod 10^n) where k > 1.A085877
Smallest square k^2 == 1 (mod 10^n) where k > 1.
- Smallest n-th power k^n == 1 (mod 10^n), where k>1.A085878
Smallest n-th power k^n == 1 (mod 10^n), where k>1.
- Smallest n-th power k^n == 1 (mod 10), where k>1.A085879
Smallest n-th power k^n == 1 (mod 10), where k>1.
- Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).A085880
Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).
- Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).A085881
Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- a(1) = 2, a(n) = smallest prime of the form 2*k*prime(n)*a(n-1) + 1.A085882
a(1) = 2, a(n) = smallest prime of the form 2*k*prime(n)*a(n-1) + 1.
- Let r and s be such that r + s = n; a(n) = maximum value of tau(r) + tau(s).A085883
Let r and s be such that r + s = n; a(n) = maximum value of tau(r) + tau(s).
- Let r and s be such that r + s = n; a(n) = maximum value of sigma(r) + sigma(s).A085884
Let r and s be such that r + s = n; a(n) = maximum value of sigma(r) + sigma(s).
- Let r and s be such that r + s = n; a(n) = maximum value of phi(r) + phi(s).A085885
Let r and s be such that r + s = n; a(n) = maximum value of phi(r) + phi(s).
- Let r and s be such that r + s = n; a(n) = minimum value of phi(r) + phi(s).A085886
Let r and s be such that r + s = n; a(n) = minimum value of phi(r) + phi(s).
- Let r and s be such that r + s = n; a(n) = minimum value of tau(r) + tau(s).A085887
Let r and s be such that r + s = n; a(n) = minimum value of tau(r) + tau(s).
- Let r and s be such that r + s = n; a(n) = minimum value of sigma(r) + sigma(s).A085888
Let r and s be such that r + s = n; a(n) = minimum value of sigma(r) + sigma(s).
- 7-smooth numbers (A002473) using digits in increasing order. 9 is followed by a zero.A085889
7-smooth numbers (A002473) using digits in increasing order. 9 is followed by a zero.
- 7-smooth numbers (A002473) using digits in descending order. Zero is followed by a 9.A085890
7-smooth numbers (A002473) using digits in descending order. Zero is followed by a 9.
- Maximal product of three numbers with sum n: a(n) = max(r*s*t), n = r+s+t.A085891
Maximal product of three numbers with sum n: a(n) = max(r*s*t), n = r+s+t.
- Group the natural numbers such that the product of the n-th group has n prime divisors: (1), (2), (3,4), (5,6,), (7,8,9,10), (11,12,13,14), (15,16,17,18,19,20,21), ... Sequence contains the product of the terms of the groups.A085892
Group the natural numbers such that the product of the n-th group has n prime divisors: (1), (2), (3,4), (5,6,), (7,8,9,10), (11,12,13,14), (15,16,17,18,19,20,21), ... Sequence contains the product of the terms of the groups.
- Group the natural numbers such that the product of the n-th group has n prime divisors. (1), (2), (3,4), (5,6,),(7,8,9,10),(11,12,13,14),(15,16,17,18,19,20,21),... Sequence contains the number of terms in the groups.A085893
Group the natural numbers such that the product of the n-th group has n prime divisors. (1), (2), (3,4), (5,6,),(7,8,9,10),(11,12,13,14),(15,16,17,18,19,20,21),... Sequence contains the number of terms in the groups.
- Group the natural numbers such that the product of the n-th group has n prime divisors. (1), (2), (3,4), (5,6,),(7,8,9,10),(11,12,13,14),(15,16,17,18,19,20,21),... Sequence contains first terms of every group.A085894
Group the natural numbers such that the product of the n-th group has n prime divisors. (1), (2), (3,4), (5,6,),(7,8,9,10),(11,12,13,14),(15,16,17,18,19,20,21),... Sequence contains first terms of every group.
- Group the natural numbers such that the product of the n-th group is divisible by 2^n. (1), (2), (3,4), (5,6,7,8), (9,10,11,12,13,14),(15,16,17,18), ... Sequence contains the product of the terms of the groups.A085895
Group the natural numbers such that the product of the n-th group is divisible by 2^n. (1), (2), (3,4), (5,6,7,8), (9,10,11,12,13,14),(15,16,17,18), ... Sequence contains the product of the terms of the groups.
- Group the natural numbers such that the product of the n-th group is divisible by 2^n . (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains the number of terms in each group.A085896
Group the natural numbers such that the product of the n-th group is divisible by 2^n . (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains the number of terms in each group.
- Group the natural numbers such that the product of the n-th group is divisible by 2^n . (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains the first term of the groups.A085897
Group the natural numbers such that the product of the n-th group is divisible by 2^n . (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains the first term of the groups.
- Group the natural numbers such that the product of the n-th group is divisible by 2^n. (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains highest power of 2 that divides the product of the terms of the n-th group. a(n) =k, where A085895(n)/(2^k) is the smallest possible integer. By definition a(n) > or = n.A085898
Group the natural numbers such that the product of the n-th group is divisible by 2^n. (1), (2) (3,4), (5,6,7,8), (9,10,11,12,13,14,),(15,16,17,18),... Sequence contains highest power of 2 that divides the product of the terms of the n-th group. a(n) =k, where A085895(n)/(2^k) is the smallest possible integer. By definition a(n) > or = n.
- a(n) = floor( 2*(1 + n + 2*n^2 + 4*n^3)/(1 + 2*n + n^2)).A085899
a(n) = floor( 2*(1 + n + 2*n^2 + 4*n^3)/(1 + 2*n + n^2)).
- Numbers k such that k-th cyclotomic polynomial has exactly 3 negative coefficients.A085900
Numbers k such that k-th cyclotomic polynomial has exactly 3 negative coefficients.
- Duplicate of A077224.A085901
Duplicate of A077224.
- a(0) = 2, a(n) is the smallest squarefree number > a(n-1) such that the sum a(n) + a(i) for all i = 1 to (n-1) is squarefree. Or, sum of any two terms is a squarefree number.A085902
a(0) = 2, a(n) is the smallest squarefree number > a(n-1) such that the sum a(n) + a(i) for all i = 1 to (n-1) is squarefree. Or, sum of any two terms is a squarefree number.
- Expansion of (1 + 2*x^2)/((1 + x)*(1 - 2*x)*(1 - 2*x^2)).A085903
Expansion of (1 + 2*x^2)/((1 + x)*(1 - 2*x)*(1 - 2*x^2)).
- Numbers k such that k, k+1 and k+2 are 7-smooth, i.e., all prime divisors <= 7 (A002473).A085904
Numbers k such that k, k+1 and k+2 are 7-smooth, i.e., all prime divisors <= 7 (A002473).
- Permanent of the symmetric n X n matrix M defined by M(i,j) = lcm(i,j) for 1 <= i,j <= n.A085905
Permanent of the symmetric n X n matrix M defined by M(i,j) = lcm(i,j) for 1 <= i,j <= n.
- Ramanujan sum c_n(6).A085906
Ramanujan sum c_n(6).
- 7-smooth numbers using digits 2,3,5 and 7 only. Numbers using prime digits and having prime divisors < 10.A085907
7-smooth numbers using digits 2,3,5 and 7 only. Numbers using prime digits and having prime divisors < 10.
- Smallest 7-smooth number beginning with n.A085908
Smallest 7-smooth number beginning with n.
- Smallest prime p>prime(n) such that p+prime(n+1)-prime(n) is the next prime after p; or a(n)=0 if no such prime exists.A085909
Smallest prime p>prime(n) such that p+prime(n+1)-prime(n) is the next prime after p; or a(n)=0 if no such prime exists.
- a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).A085910
a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).