Sequences
392,541 sequences
- Numbers k > 1 such that, in base 7, k and k^2 contain the same digits in the same proportion.A061661
Numbers k > 1 such that, in base 7, k and k^2 contain the same digits in the same proportion.
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.A061662
Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.
- Numbers k > 1 such that, in base 9, k and k^2 contain the same digits in the same proportion.A061663
Numbers k > 1 such that, in base 9, k and k^2 contain the same digits in the same proportion.
- a(n) is the smallest number k >= 2 for which k and k^2 contain the same digits in the same proportion in base n.A061664
a(n) is the smallest number k >= 2 for which k and k^2 contain the same digits in the same proportion in base n.
- Numbers n whose digits in their prime factorization are the same as those of the prime factorization of n+1.A061665
Numbers n whose digits in their prime factorization are the same as those of the prime factorization of n+1.
- Continued fraction for Pi/e.A061666
Continued fraction for Pi/e.
- a(n) = Fibonacci(2*n+1) - 2^(n-1).A061667
a(n) = Fibonacci(2*n+1) - 2^(n-1).
- Numbers k such that x-4, x-2, x+2, x+4 are primes, where x = 30*k - 15.A061668
Numbers k such that x-4, x-2, x+2, x+4 are primes, where x = 30*k - 15.
- a(n) = n*(mu(n) + 1), where mu(n) is the Moebius function A008683.A061669
a(n) = n*(mu(n) + 1), where mu(n) is the Moebius function A008683.
- Distance to nearest prime power p^k, k=0 and k >= 2 (A025475).A061670
Distance to nearest prime power p^k, k=0 and k >= 2 (A025475).
- Numbers n such that { x +- 2^k : 0 < k < 4 } are primes, where x = 210*n - 105.A061671
Numbers n such that { x +- 2^k : 0 < k < 4 } are primes, where x = 210*n - 105.
- Smallest positive number formed by a set of digits whose product = sum of the digits.A061672
Smallest positive number formed by a set of digits whose product = sum of the digits.
- Even numbers k such that k+1 and k-1 are both composite.A061673
Even numbers k such that k+1 and k-1 are both composite.
- Smallest k such that k*n is a palindrome or becomes a palindrome when 0's are added on the left.A061674
Smallest k such that k*n is a palindrome or becomes a palindrome when 0's are added on the left.
- a(n) = floor(Pi^n + e^n).A061675
a(n) = floor(Pi^n + e^n).
- Triangle T(n,k) of number of ways of throwing k standard dice to produce a total of n.A061676
Triangle T(n,k) of number of ways of throwing k standard dice to produce a total of n.
- When squared gives number composed just of the digits 1, 2, 3, 4.A061677
When squared gives number composed just of the digits 1, 2, 3, 4.
- Continued fraction for Sum_{k>=0} 1/3^(3^k).A061678
Continued fraction for Sum_{k>=0} 1/3^(3^k).
- Concatenation of n^3 and 7.A061679
Concatenation of n^3 and 7.
- a(n) = gcd(d(n^2), d(n)).A061680
a(n) = gcd(d(n^2), d(n)).
- a(0)=1; a(n) = a(n-1) + lead(a(n-1)) for n > 0 where for an integer x lead(x) is the leading digit in base 10.A061681
a(0)=1; a(n) = a(n-1) + lead(a(n-1)) for n > 0 where for an integer x lead(x) is the leading digit in base 10.
- Length of period of continued fraction expansion of square root of (2^(2n+1)+1).A061682
Length of period of continued fraction expansion of square root of (2^(2n+1)+1).
- Generalized Bell numbers.A061683
Generalized Bell numbers.
- Generalized Bell numbers: column 3 of A275043.A061684
Generalized Bell numbers: column 3 of A275043.
- Generalized Bell numbers: column 4 of A275043.A061685
Generalized Bell numbers: column 4 of A275043.
- Generalized Bell numbers: column 5 of A275043.A061686
Generalized Bell numbers: column 5 of A275043.
- Generalized Bell numbers: column 6 of A275043.A061687
Generalized Bell numbers: column 6 of A275043.
- Generalized Bell numbers: column 7 of A275043.A061688
Generalized Bell numbers: column 7 of A275043.
- Generalized Stirling numbers.A061689
Generalized Stirling numbers.
- Generalized Stirling numbers.A061690
Generalized Stirling numbers.
- Triangle of generalized Stirling numbers.A061691
Triangle of generalized Stirling numbers.
- Triangle of generalized Stirling numbers.A061692
Triangle of generalized Stirling numbers.
- Generalized Bell numbers.A061693
Generalized Bell numbers.
- Generalized Bell numbers.A061694
Generalized Bell numbers.
- Generalized Bell numbers.A061695
Generalized Bell numbers.
- Generalized Bell numbers.A061696
Generalized Bell numbers.
- Generalized Bell numbers.A061697
Generalized Bell numbers.
- Erroneous version of A061684.A061698
Erroneous version of A061684.
- Generalized Bell numbers.A061699
Generalized Bell numbers.
- Generalized Bell numbers.A061700
Generalized Bell numbers.
- Smallest number m such that GCD of d(m^2) and d(m) is 2n+1 where d(m) is the number of divisors of m.A061701
Smallest number m such that GCD of d(m^2) and d(m) is 2n+1 where d(m) is the number of divisors of m.
- Triangle T(n,k) defined by Sum_{n >= 0,m >= 0} T(n,m)*x^m*y^n = 1 + y*(1 + 3*x - 4*x^2*y - 3*x^2*y^2 - 3*x^3*y^2 + 4*x^4*y^3)/((1 - y - 2*x*y - x*y^2 + x^3*y^3)*(1 - x*y)).A061702
Triangle T(n,k) defined by Sum_{n >= 0,m >= 0} T(n,m)*x^m*y^n = 1 + y*(1 + 3*x - 4*x^2*y - 3*x^2*y^2 - 3*x^3*y^2 + 4*x^4*y^3)/((1 - y - 2*x*y - x*y^2 + x^3*y^3)*(1 - x*y)).
- G.f.: 2*x*(2-2*x-3*x^2+2*x^3)/((1-3*x-x^2+x^3)*(1-x)).A061703
G.f.: 2*x*(2-2*x-3*x^2+2*x^3)/((1-3*x-x^2+x^3)*(1-x)).
- Number of cubes dividing n.A061704
Number of cubes dividing n.
- Number of matchings in the wheel graph with n spokes.A061705
Number of matchings in the wheel graph with n spokes.
- G.f.: x^2*(x-1)^8/(4*x^9+x^8-79*x^7+166*x^6-225*x^5+206*x^4-129*x^3+50*x^2-11*x+1).A061706
G.f.: x^2*(x-1)^8/(4*x^9+x^8-79*x^7+166*x^6-225*x^5+206*x^4-129*x^3+50*x^2-11*x+1).
- Smallest number with exactly n^2 divisors.A061707
Smallest number with exactly n^2 divisors.
- Smallest number whose square has (2n - 1)^2 divisors.A061708
Smallest number whose square has (2n - 1)^2 divisors.
- Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.A061709
Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.
- Number of maximal chains in the Bruhat order of S_n.A061710
Number of maximal chains in the Bruhat order of S_n.