Sequences
392,541 sequences
- Iccanobirt sequence: a(n) = R(a(n-1)) + R(a(n-2)) + R(a(n-3)) where a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.A074861
Iccanobirt sequence: a(n) = R(a(n-1)) + R(a(n-2)) + R(a(n-3)) where a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.
- Iccanartet sequence: a(n)=R[a(n-1)]+R[a(n-2)]+R[a(n-3)]+R[a(n-4)] where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.A074862
Iccanartet sequence: a(n)=R[a(n-1)]+R[a(n-2)]+R[a(n-3)]+R[a(n-4)] where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.
- a(n) = a(n-1) + a(n-2) + a(n-3) + R(a(n-4)) where a(0)=a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.A074863
a(n) = a(n-1) + a(n-2) + a(n-3) + R(a(n-4)) where a(0)=a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.
- a(n) = a(n-1) + a(n-2) + R(a(n-3)) + R(a(n-4)) where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.A074864
a(n) = a(n-1) + a(n-2) + R(a(n-3)) + R(a(n-4)) where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.
- a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)) + R(a(n-4)) where a(1) = a(2) = a(3) = a(4) = 1 and R(n) (A004086) is the reverse of n.A074865
a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)) + R(a(n-4)) where a(1) = a(2) = a(3) = a(4) = 1 and R(n) (A004086) is the reverse of n.
- Non-balanced numbers in A015763.A074866
Non-balanced numbers in A015763.
- a(n) = M(a(n-1)) + M(a(n-2)) where a(1)=a(2)=1 and M(k) is the product of the digits of k in base 10.A074867
a(n) = M(a(n-1)) + M(a(n-2)) where a(1)=a(2)=1 and M(k) is the product of the digits of k in base 10.
- Non-balanced numbers in A015765.A074868
Non-balanced numbers in A015765.
- Numbers n such that sigma(sigma(n) - phi(n)) = phi(n).A074869
Numbers n such that sigma(sigma(n) - phi(n)) = phi(n).
- Smallest interprimes of the form n*prime.A074870
Smallest interprimes of the form n*prime.
- Start with n and repeatedly apply the map k -> T(k) = A053837(k) + A171765(k); a(n) is the number of steps (at least one) until a prime is reached, or 0 if no prime is ever reached.A074871
Start with n and repeatedly apply the map k -> T(k) = A053837(k) + A171765(k); a(n) is the number of steps (at least one) until a prime is reached, or 0 if no prime is ever reached.
- Inverse BinomialMean transform of the Fibonacci sequence A000045 (with the initial 0 omitted).A074872
Inverse BinomialMean transform of the Fibonacci sequence A000045 (with the initial 0 omitted).
- Friendly numbers (see A074902) such that sigma(n) is not friendly.A074873
Friendly numbers (see A074902) such that sigma(n) is not friendly.
- Numbers n such that phi(n + phi(n)) = sigma(n).A074874
Numbers n such that phi(n + phi(n)) = sigma(n).
- Numbers k such that sigma(sigma(k)-k) = phi(k).A074875
Numbers k such that sigma(sigma(k)-k) = phi(k).
- Numbers n such that sigma(sigma(n) - phi(n)) = phi(sigma(n) + phi(n)).A074876
Numbers n such that sigma(sigma(n) - phi(n)) = phi(sigma(n) + phi(n)).
- Number of function calls required to compute ack(3,n), where ack denotes the Ackermann function.A074877
Number of function calls required to compute ack(3,n), where ack denotes the Ackermann function.
- Row sums of triangle in A074829.A074878
Row sums of triangle in A074829.
- 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).A074879
10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).
- Number of labeled cyclic subgroups of S_n having order n.A074880
Number of labeled cyclic subgroups of S_n having order n.
- Triangle T(n,k) giving number of labeled cyclic subgroups of order k in symmetric group S_n, n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.A074881
Triangle T(n,k) giving number of labeled cyclic subgroups of order k in symmetric group S_n, n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.
- Number of integers in {1, 2, ..., sigma(n)} that are coprime to n.A074882
Number of integers in {1, 2, ..., sigma(n)} that are coprime to n.
- Triangle generated by Pascal's rule, except begin and end the n-th row with sigma(n).A074883
Triangle generated by Pascal's rule, except begin and end the n-th row with sigma(n).
- For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.A074884
For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.
- Numbers not of the form x^2 + M*y^2 for integers x > 0, y > 1, M > 0.A074885
Numbers not of the form x^2 + M*y^2 for integers x > 0, y > 1, M > 0.
- Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).A074886
Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).
- Numbers n such that sigma(n - phi(n)) = phi(n + phi(n)).A074887
Numbers n such that sigma(n - phi(n)) = phi(n + phi(n)).
- Smaller of consecutive values in A075407.A074888
Smaller of consecutive values in A075407.
- Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.A074889
Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.
- a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.A074890
a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.
- Numbers n such that sigma(n) = phi(3n).A074891
Numbers n such that sigma(n) = phi(3n).
- Duplicate of A074874.A074892
Duplicate of A074874.
- Continued fraction for the Product_{p prime} (1 - 2/p^2) (A065474).A074893
Continued fraction for the Product_{p prime} (1 - 2/p^2) (A065474).
- Full list of counterexamples for the k=3 version of the malicious apprentice problem.A074894
Full list of counterexamples for the k=3 version of the malicious apprentice problem.
- Primes written backwards and sorted.A074895
Primes written backwards and sorted.
- Squares written backwards and sorted, duplicates removed.A074896
Squares written backwards and sorted, duplicates removed.
- Possible values for sum of anti-divisors of n.A074897
Possible values for sum of anti-divisors of n.
- Impossible values for sum of anti-divisors of n.A074898
Impossible values for sum of anti-divisors of n.
- Triangular numbers written backwards and sorted, duplicates removed.A074899
Triangular numbers written backwards and sorted, duplicates removed.
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3 (primitive values of n only).A074900
Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3 (primitive values of n only).
- Increasingly larger bases required for composite numbers to become prime by base reversal (A075243).A074901
Increasingly larger bases required for composite numbers to become prime by base reversal (A075243).
- Known friendly numbers.A074902
Known friendly numbers.
- Decimal expansion of the mean number of iterations in comparing two numbers via their continued fractions.A074903
Decimal expansion of the mean number of iterations in comparing two numbers via their continued fractions.
- Decimal expansion of trace of Gaussian operator.A074904
Decimal expansion of trace of Gaussian operator.
- a(n) = number of terms in A030229 between prime(n) and prime(n+1).A074905
a(n) = number of terms in A030229 between prime(n) and prime(n+1).
- Aliquot sequence starting at 1521.A074906
Aliquot sequence starting at 1521.
- Aliquot sequence starting at 570.A074907
Aliquot sequence starting at 570.
- Number of integers with an odd number of distinct primes (for which mu(n)=-1) between two consecutive primes prime(n) and prime(n+1).A074908
Number of integers with an odd number of distinct primes (for which mu(n)=-1) between two consecutive primes prime(n) and prime(n+1).
- Running sum of Pascal's triangle (A007318), or beheaded Pascal's triangle read by beheaded rows.A074909
Running sum of Pascal's triangle (A007318), or beheaded Pascal's triangle read by beheaded rows.
- Moebius function applied to A053422.A074910
Moebius function applied to A053422.