Sequences
392,541 sequences
- Palindromic numbers j that are not of the form k + reverse(k) for any k.A068061
Palindromic numbers j that are not of the form k + reverse(k) for any k.
- Palindromes n of the form k + reverse(k) for at least one k.A068062
Palindromes n of the form k + reverse(k) for at least one k.
- Maximum cardinality of a nondividing subset of {1, 2, ..., n}.A068063
Maximum cardinality of a nondividing subset of {1, 2, ..., n}.
- a(n) = number of integers k such that palindrome A068062(n) = k + reverse(k).A068064
a(n) = number of integers k such that palindrome A068062(n) = k + reverse(k).
- Palindromes n for which there is a unique k such that n = k + reverse(k).A068065
Palindromes n for which there is a unique k such that n = k + reverse(k).
- The sum or half the sum of n consecutive primes starting at a(n) is prime.A068066
The sum or half the sum of n consecutive primes starting at a(n) is prime.
- Number of integers m, 0 < m <= n, such that n divides m(m+1)/2.A068067
Number of integers m, 0 < m <= n, such that n divides m(m+1)/2.
- Number of odd unitary divisors of n. d is a unitary divisor of n if d divides n and gcd(d,n/d) = 1.A068068
Number of odd unitary divisors of n. d is a unitary divisor of n if d divides n and gcd(d,n/d) = 1.
- a(n) is the least k which is the start of n consecutive integers each with a different number, 1 through n, of distinct prime factors.A068069
a(n) is the least k which is the start of n consecutive integers each with a different number, 1 through n, of distinct prime factors.
- Number of digits in 10^n-th Fibonacci number.A068070
Number of digits in 10^n-th Fibonacci number.
- Triangular numbers that remain triangular when the least significant digit is moved to the beginning.A068071
Triangular numbers that remain triangular when the least significant digit is moved to the beginning.
- Number of Pluperfect Digital Invariants base n.A068072
Number of Pluperfect Digital Invariants base n.
- Period 4 sequence [ 1, 2, 3, 2, ...].A068073
Period 4 sequence [ 1, 2, 3, 2, ...].
- a(n) = Sum_{d|n} (-1)^d*2^omega(n/d) where omega(x) is the number of distinct prime factors in the factorization of x.A068074
a(n) = Sum_{d|n} (-1)^d*2^omega(n/d) where omega(x) is the number of distinct prime factors in the factorization of x.
- Lesser of a primitive pair such that n and its 10's complement are simultaneously square.A068075
Lesser of a primitive pair such that n and its 10's complement are simultaneously square.
- Number of positive integers < n with the same number of 1's in their binary expansions as n.A068076
Number of positive integers < n with the same number of 1's in their binary expansions as n.
- Numbers k such that sigma(k) + sigma(k+1) = 4k.A068077
Numbers k such that sigma(k) + sigma(k+1) = 4k.
- Numbers k such that (sigma(k)+sigma(k+1))/k is an integer.A068078
Numbers k such that (sigma(k)+sigma(k+1))/k is an integer.
- Decimal expansion of 355 / 113.A068079
Decimal expansion of 355 / 113.
- Integers n such that n + phi(n) is a prime.A068080
Integers n such that n + phi(n) is a prime.
- Numbers n such that n + phi(n) and n - phi(n) are prime.A068081
Numbers n such that n + phi(n) and n - phi(n) are prime.
- a(1) = 1, a(n) = smallest triangular number of the form k*a(n-1) + 1 for some positive integer k.A068082
a(1) = 1, a(n) = smallest triangular number of the form k*a(n-1) + 1 for some positive integer k.
- a(1) = 1, a(n) is the smallest Fibonacci number of the form k*a(n-1) + 1 with k>0.A068083
a(1) = 1, a(n) is the smallest Fibonacci number of the form k*a(n-1) + 1 with k>0.
- Smallest triangular number which is a multiple (>1) of the n-th triangular number.A068084
Smallest triangular number which is a multiple (>1) of the n-th triangular number.
- Numbers k such that k and 10*k are both triangular numbers.A068085
Numbers k such that k and 10*k are both triangular numbers.
- a(n) = A036229(n) - 111...1 (with n 1's).A068086
a(n) = A036229(n) - 111...1 (with n 1's).
- a(n) = n^(2*n-2).A068087
a(n) = n^(2*n-2).
- Numbers k such that k-3, k-2, k-1, k+1, k+2 and k+3 are squarefree.A068088
Numbers k such that k-3, k-2, k-1, k+1, k+2 and k+3 are squarefree.
- Decimal expansion of 104348 / 33215.A068089
Decimal expansion of 104348 / 33215.
- Numbers n which divide the right concatenation of the first n even numbers.A068090
Numbers n which divide the right concatenation of the first n even numbers.
- Number of board-pair-pile hexagonal polyominoes with n cells.A068091
Number of board-pair-pile hexagonal polyominoes with n cells.
- Index of smallest triangular number with n digits.A068092
Index of smallest triangular number with n digits.
- Smallest n-digit triangular number.A068093
Smallest n-digit triangular number.
- Number of n-digit triangular numbers.A068094
Number of n-digit triangular numbers.
- All primes dividing each term are Fibonacci numbers.A068095
All primes dividing each term are Fibonacci numbers.
- a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.A068096
a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.
- a(1) = 1; a(n+1) = smallest triangular numbers starting with a(n).A068097
a(1) = 1; a(n+1) = smallest triangular numbers starting with a(n).
- a(n) = Lucas(Fibonacci(n)).A068098
a(n) = Lucas(Fibonacci(n)).
- a(1) = 1; a(n+1) = n! * Sum_{d|n} a(d)/d where the sum is over the positive divisors d of n.A068099
a(1) = 1; a(n+1) = n! * Sum_{d|n} a(d)/d where the sum is over the positive divisors d of n.
- a(1) = 1; a(n+1) = n!*Sum_{k|n} a(k)/k!.A068100
a(1) = 1; a(n+1) = n!*Sum_{k|n} a(k)/k!.
- a(n) = Sum_{k|n, k<=sqrt(n)} mu(k) where mu(k) is the Moebius function and the sum is over the positive divisors k of n with k <= sqrt(n).A068101
a(n) = Sum_{k|n, k<=sqrt(n)} mu(k) where mu(k) is the Moebius function and the sum is over the positive divisors k of n with k <= sqrt(n).
- a(n) = n! * 2^n * Sum_{i=1..n} 1/(i*2^i).A068102
a(n) = n! * 2^n * Sum_{i=1..n} 1/(i*2^i).
- Smallest prime starting with at least n 2s.A068103
Smallest prime starting with at least n 2s.
- Smallest prime starting with n 3s.A068104
Smallest prime starting with n 3s.
- Smallest prime starting with n 5s.A068105
Smallest prime starting with n 5s.
- Euler's difference table: triangle read by rows, formed by starting with factorial numbers (A000142) and repeatedly taking differences. T(n,n) = n!, T(n,k) = T(n,k+1) - T(n-1,k).A068106
Euler's difference table: triangle read by rows, formed by starting with factorial numbers (A000142) and repeatedly taking differences. T(n,n) = n!, T(n,k) = T(n,k+1) - T(n-1,k).
- a(n) = n!*Sum_{k=1..n} mu(k)/k!, where mu(k) is the Moebius function.A068107
a(n) = n!*Sum_{k=1..n} mu(k)/k!, where mu(k) is the Moebius function.
- a(1) = 1; a(n+1) = sum{k|n k<=sqrt(n)} a(k) where sum is over the positive divisors k of n with k <= sqrt(n).A068108
a(1) = 1; a(n+1) = sum{k|n k<=sqrt(n)} a(k) where sum is over the positive divisors k of n with k <= sqrt(n).
- a(1) = 0, a(2) = 1, a(n) = concatenate(a(n-1) and a(n-2)) - a(n-1).A068109
a(1) = 0, a(2) = 1, a(n) = concatenate(a(n-1) and a(n-2)) - a(n-1).
- Denominators of coefficients in J0(i*sqrt(x))^2 power series where J0 denotes the ordinary Bessel function of order 0.A068110
Denominators of coefficients in J0(i*sqrt(x))^2 power series where J0 denotes the ordinary Bessel function of order 0.