Sequences
392,541 sequences
- Triangle in A075059 read by rows.A075061
Triangle in A075059 read by rows.
- Row sums of triangle in A075059.A075062
Row sums of triangle in A075059.
- Smallest prime == 1 mod first n composite numbers.A075063
Smallest prime == 1 mod first n composite numbers.
- Smallest composite number == 1 mod first n prime numbers.A075064
Smallest composite number == 1 mod first n prime numbers.
- a(1) = 1 and then alternately even and odd composite numbers matching the parity of the index.A075065
a(1) = 1 and then alternately even and odd composite numbers matching the parity of the index.
- Alternately odd and even composite numbers complementing the parity of the index.A075066
Alternately odd and even composite numbers complementing the parity of the index.
- Start of the first run of exactly n consecutive odd composite numbers.A075067
Start of the first run of exactly n consecutive odd composite numbers.
- Product of prime(n) primes starting from prime(n).A075068
Product of prime(n) primes starting from prime(n).
- Product of prime(n) consecutive numbers starting from prime(n).A075069
Product of prime(n) consecutive numbers starting from prime(n).
- a(n) = n-th compositorial number / (product of those primes which divide the n-th compositorial number).A075070
a(n) = n-th compositorial number / (product of those primes which divide the n-th compositorial number).
- n! divided by product of factorials of all proper divisors of n, as n runs through the values for which the result is an integer.A075071
n! divided by product of factorials of all proper divisors of n, as n runs through the values for which the result is an integer.
- a(1) = 1; for n > 1, a(n) = n! divided by product of factorials of all prime divisors of n.A075072
a(1) = 1; for n > 1, a(n) = n! divided by product of factorials of all prime divisors of n.
- Numbers k such that k-th perfect power - k is prime: A001597(k) - k is prime.A075073
Numbers k such that k-th perfect power - k is prime: A001597(k) - k is prime.
- Integers pertaining to A099520: a(n) = {b(n)+b(n+1)}/n where b(n) is the n-th term of A099520.A075074
Integers pertaining to A099520: a(n) = {b(n)+b(n+1)}/n where b(n) is the n-th term of A099520.
- a(1) = 1, a(2) = 2 and then the smallest number not occurring earlier such that every term divides the product of its neighbors: a(n-1)*a(n+1)/a(n) is an integer.A075075
a(1) = 1, a(2) = 2 and then the smallest number not occurring earlier such that every term divides the product of its neighbors: a(n-1)*a(n+1)/a(n) is an integer.
- Integers pertaining to A075075: a(n) = b(n-1)*b(n+1)/b(n) where b(n) is the n-th term of A075075.A075076
Integers pertaining to A075075: a(n) = b(n-1)*b(n+1)/b(n) where b(n) is the n-th term of A075075.
- a(1) =1 and then the smallest number not occurring earlier such that a(n)+a(n+1) gives a different composite number (not obtained earlier).A075077
a(1) =1 and then the smallest number not occurring earlier such that a(n)+a(n+1) gives a different composite number (not obtained earlier).
- Composite numbers which do not arise as a sum of two neighboring terms of A075077.A075078
Composite numbers which do not arise as a sum of two neighboring terms of A075077.
- Numbers k in A001597 such that 2*k + 1 is prime.A075079
Numbers k in A001597 such that 2*k + 1 is prime.
- Erroneous version of A056218.A075080
Erroneous version of A056218.
- Perfect powers q (A001597) such that (q-1)/2 is prime.A075081
Perfect powers q (A001597) such that (q-1)/2 is prime.
- Numbers n such that n! is a product of distinct factorials k!*l!*m!*... with k, l, m, etc. < n.A075082
Numbers n such that n! is a product of distinct factorials k!*l!*m!*... with k, l, m, etc. < n.
- Largest composite number formed by permuting the digits of n, or 0 if no such number exists.A075083
Largest composite number formed by permuting the digits of n, or 0 if no such number exists.
- Number of composite numbers c with n <= c <= 2*n.A075084
Number of composite numbers c with n <= c <= 2*n.
- a(n) is the smallest number not already in the sequence such that Sum_{k=1..n} a(k) is divisible by prime(n).A075085
a(n) is the smallest number not already in the sequence such that Sum_{k=1..n} a(k) is divisible by prime(n).
- Rearrangement of natural numbers such that the n-th partial sum is divisible by the n-th composite number.A075086
Rearrangement of natural numbers such that the n-th partial sum is divisible by the n-th composite number.
- Rearrangement of natural numbers such that the n-th partial sum is divisible by the n-th squarefree number.A075087
Rearrangement of natural numbers such that the n-th partial sum is divisible by the n-th squarefree number.
- Smallest triangular number with n prime factors (counted with multiplicity).A075088
Smallest triangular number with n prime factors (counted with multiplicity).
- Smallest prime == 1 mod n-th composite number.A075089
Smallest prime == 1 mod n-th composite number.
- Even perfect powers: numbers of the form (2*m)^k for some m>=1 and k>=2.A075090
Even perfect powers: numbers of the form (2*m)^k for some m>=1 and k>=2.
- Sum of Lucas numbers and reflected Lucas numbers (comment to A061084).A075091
Sum of Lucas numbers and reflected Lucas numbers (comment to A061084).
- Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).A075092
Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).
- Smallest member of Ormiston prime triple.A075093
Smallest member of Ormiston prime triple.
- Triangle of the sorted orders of graph automorphism groups for the simple graphs.A075094
Triangle of the sorted orders of graph automorphism groups for the simple graphs.
- Number of simple graphs g on n nodes with |Aut(g)| = 2.A075095
Number of simple graphs g on n nodes with |Aut(g)| = 2.
- Number of simple graphs g on n nodes with |Aut(g)| = 4.A075096
Number of simple graphs g on n nodes with |Aut(g)| = 4.
- Number of simple graphs g on n nodes with |Aut(g)| = 6.A075097
Number of simple graphs g on n nodes with |Aut(g)| = 6.
- Number of simple graphs g on n nodes with |Aut(g)| = 8.A075098
Number of simple graphs g on n nodes with |Aut(g)| = 8.
- Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators.A075099
Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators.
- Number of words of length strictly between 1 and n that are needed on the way to computing all words of length n in the free monoid with two generators.A075100
Number of words of length strictly between 1 and n that are needed on the way to computing all words of length n in the free monoid with two generators.
- Numerator of 2^n/n.A075101
Numerator of 2^n/n.
- Number of steps to reach the first integer starting with 2^n/n and iterating the map x->x*ceiling(x), or -1 if no integer is ever reached.A075102
Number of steps to reach the first integer starting with 2^n/n and iterating the map x->x*ceiling(x), or -1 if no integer is ever reached.
- Integer reached in A075102.A075103
Integer reached in A075102.
- Greatest common divisor of n and integer part of log_2(n).A075104
Greatest common divisor of n and integer part of log_2(n).
- Numerator of n/floor(log_2(n)); denominator is A075106(n).A075105
Numerator of n/floor(log_2(n)); denominator is A075106(n).
- Denominator of n/floor(log_2(n)); numerator is A075105(n).A075106
Denominator of n/floor(log_2(n)); numerator is A075105(n).
- Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.A075107
Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
- First integer reached when starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x) A075107(n) times, or -1 if no integer is ever reached.A075108
First integer reached when starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x) A075107(n) times, or -1 if no integer is ever reached.
- Odd perfect powers (1 together with numbers m^k, m odd, k >= 2).A075109
Odd perfect powers (1 together with numbers m^k, m odd, k >= 2).
- Concatenation of n-th prime and n in decimal notation.A075110
Concatenation of n-th prime and n in decimal notation.