Sequences
392,541 sequences
- a(n) = constant arising in game of n-times nim.A079511
a(n) = constant arising in game of n-times nim.
- a(0)=1, a(1)=1; for n>1, a(n) = Sum_{i=0..n/2} binomial(n-i-1,i)*a(n-2i-1) + ((n+1) mod 2).A079512
a(0)=1, a(1)=1; for n>1, a(n) = Sum_{i=0..n/2} binomial(n-i-1,i)*a(n-2i-1) + ((n+1) mod 2).
- Triangular array (a Riordan array) related to tennis ball problem, read by rows.A079513
Triangular array (a Riordan array) related to tennis ball problem, read by rows.
- Second column of triangular array in A079513.A079514
Second column of triangular array in A079513.
- Coefficients related to tennis ball problem.A079515
Coefficients related to tennis ball problem.
- Coefficients related to tennis ball problem.A079516
Coefficients related to tennis ball problem.
- Coefficients related to tennis ball problem.A079517
Coefficients related to tennis ball problem.
- Coefficients related to tennis ball problem.A079518
Coefficients related to tennis ball problem.
- Related to tennis ball problem.A079519
Related to tennis ball problem.
- Triangular array related to tennis ball problem, read by rows.A079520
Triangular array related to tennis ball problem, read by rows.
- Triangular array related to tennis ball problem, read by rows.A079521
Triangular array related to tennis ball problem, read by rows.
- Diagonal of triangular array in A079520.A079522
Diagonal of triangular array in A079520.
- Utterly odd numbers: numbers whose binary representation ends in an odd number of ones.A079523
Utterly odd numbers: numbers whose binary representation ends in an odd number of ones.
- Expansion of (x + b*x^2 - b*x^3)/((1 - x^2)*(1 - x)^2) with b=2.A079524
Expansion of (x + b*x^2 - b*x^3)/((1 - x^2)*(1 - x)^2) with b=2.
- Erroneous version of A064164 given in the reference.A079525
Erroneous version of A064164 given in the reference.
- a(n) = floor( exp(H_n)*log(H_n) ) - sigma(n).A079526
a(n) = floor( exp(H_n)*log(H_n) ) - sigma(n).
- a(n) = floor( exp(H_n)*log(H_n) ).A079527
a(n) = floor( exp(H_n)*log(H_n) ).
- a(n) = sigma(n) - ceiling(n + sqrt n).A079528
a(n) = sigma(n) - ceiling(n + sqrt n).
- a(n) = sigma(n) - ceiling(n + sqrt n) as n runs through the composite numbers A002808.A079529
a(n) = sigma(n) - ceiling(n + sqrt n) as n runs through the composite numbers A002808.
- a(n) = phi(n) - ceiling(sqrt(n)).A079530
a(n) = phi(n) - ceiling(sqrt(n)).
- a(n) = phi(n) - ceiling(n^(2/3)).A079531
a(n) = phi(n) - ceiling(n^(2/3)).
- a(n) = floor(n - sqrt(n)) - phi(n).A079532
a(n) = floor(n - sqrt(n)) - phi(n).
- Floor(k - sqrt(k)) - phi(k) as k runs through the composite numbers (A002808).A079533
Floor(k - sqrt(k)) - phi(k) as k runs through the composite numbers (A002808).
- a(n) = phi(n) - ceiling( (log 2 / 2) * (n / log n) ).A079534
a(n) = phi(n) - ceiling( (log 2 / 2) * (n / log n) ).
- a(n) = phi(n)*d(n) - n.A079535
a(n) = phi(n)*d(n) - n.
- a(n) = phi(n)*d(n) - sigma(n).A079536
a(n) = phi(n)*d(n) - sigma(n).
- a(n) = phi(2*n+1)*d(2*n+1) - sigma(2*n+1).A079537
a(n) = phi(2*n+1)*d(2*n+1) - sigma(2*n+1).
- a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=2.A079538
a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=2.
- a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3.A079539
a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3.
- a(n) = phi(n) + d(n)*(n - phi(n)) - sigma(n).A079540
a(n) = phi(n) + d(n)*(n - phi(n)) - sigma(n).
- Numbers n such that phi(n) = d(n).A079541
Numbers n such that phi(n) = d(n).
- Triangular array: T(n,1) = T(n,n) = n and T(n,k) = lcm(T(n-1,k-1), T(n-1,k)) for 1 < k < n.A079542
Triangular array: T(n,1) = T(n,n) = n and T(n,k) = lcm(T(n-1,k-1), T(n-1,k)) for 1 < k < n.
- Numbers k such that k has at least two distinct prime factors and if a prime p divides k then (p-1) | (k-1) and (p+1) | (k+1).A079543
Numbers k such that k has at least two distinct prime factors and if a prime p divides k then (p-1) | (k-1) and (p+1) | (k+1).
- Primes of the form x^2 + y^2 + 1, x>0, y>0.A079544
Primes of the form x^2 + y^2 + 1, x>0, y>0.
- Primes of the form x^2 + y^2 + 1 with x,y >= 0.A079545
Primes of the form x^2 + y^2 + 1 with x,y >= 0.
- a(n) = sigma(n) - 4*phi(n).A079546
a(n) = sigma(n) - 4*phi(n).
- a(n) = ((n^6 - (n-1)^6) - (n^2 - (n-1)^2))/60.A079547
a(n) = ((n^6 - (n-1)^6) - (n^2 - (n-1)^2))/60.
- Array T(m,n) = n*phi(m) - phi(mn) (m,n >= 1), read by antidiagonals.A079548
Array T(m,n) = n*phi(m) - phi(mn) (m,n >= 1), read by antidiagonals.
- Array T(m,n) = m*phi(n) - phi(mn) (m,n >= 1), read by antidiagonals.A079549
Array T(m,n) = m*phi(n) - phi(mn) (m,n >= 1), read by antidiagonals.
- Array T(m,n) = phi(m^2)*phi(n^2) - phi(m*n)^2 (m,n >= 1), read by antidiagonals.A079550
Array T(m,n) = phi(m^2)*phi(n^2) - phi(m*n)^2 (m,n >= 1), read by antidiagonals.
- a(n) = Sum_{primes p <= n} d(p-1), where d() = A000005.A079551
a(n) = Sum_{primes p <= n} d(p-1), where d() = A000005.
- Record values in A079551.A079552
Record values in A079551.
- a(n) = floor( d(n^2) / d(n) ), where d() = A000005.A079553
a(n) = floor( d(n^2) / d(n) ), where d() = A000005.
- a(n) = floor( d(n) * log(n) / 2 ), where d() = A000005.A079554
a(n) = floor( d(n) * log(n) / 2 ), where d() = A000005.
- Decimal expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...A079555
Decimal expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...
- a(1) = a(2) = 2; for n>2, a(n) = a(n-2)^a(n-1).A079556
a(1) = a(2) = 2; for n>2, a(n) = a(n-2)^a(n-1).
- Numerator for global rational approximations.A079557
Numerator for global rational approximations.
- a(1)=1; a(n)=LookAndSay(a(n-1)^2) if n>1.A079558
a(1)=1; a(n)=LookAndSay(a(n-1)^2) if n>1.
- Number of partitions of n into distinct parts of the form 2^j-1, j=1,2,....A079559
Number of partitions of n into distinct parts of the form 2^j-1, j=1,2,....
- Number of divisors of n-th term of Look and Say Sequence A005150.A079560
Number of divisors of n-th term of Look and Say Sequence A005150.