Sequences
392,541 sequences
- Composite numbers the concatenation of whose prime factors is a prime.A046411
Composite numbers the concatenation of whose prime factors is a prime.
- Lengths of nonsquarefree repunits.A046412
Lengths of nonsquarefree repunits.
- Numbers k such that the repunit of length k (11...11, with k 1's) has exactly 2 prime factors.A046413
Numbers k such that the repunit of length k (11...11, with k 1's) has exactly 2 prime factors.
- Repunit of length a(n) has exactly 3 prime factors (counted with multiplicity).A046414
Repunit of length a(n) has exactly 3 prime factors (counted with multiplicity).
- Repunit of length a(n) has exactly 4 prime factors (counted with multiplicity).A046415
Repunit of length a(n) has exactly 4 prime factors (counted with multiplicity).
- Repunit of length a(n) has exactly 5 prime factors (counted with multiplicity).A046416
Repunit of length a(n) has exactly 5 prime factors (counted with multiplicity).
- Repunit of length a(n) has exactly 6 prime factors (counted with multiplicity).A046417
Repunit of length a(n) has exactly 6 prime factors (counted with multiplicity).
- Repunit of length a(n) has exactly 7 prime factors (counted with multiplicity).A046418
Repunit of length a(n) has exactly 7 prime factors (counted with multiplicity).
- Repunit of length a(n) has exactly 8 prime factors (counted with multiplicity).A046419
Repunit of length a(n) has exactly 8 prime factors (counted with multiplicity).
- Prime factors of repunit of length a(n) are all of different lengths.A046420
Prime factors of repunit of length a(n) are all of different lengths.
- Index of smallest repunit having exactly n prime factors (counted with multiplicity).A046421
Index of smallest repunit having exactly n prime factors (counted with multiplicity).
- Numbers requiring 2 steps to reach a prime under the prime factor concatenation procedure.A046422
Numbers requiring 2 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 3 steps to reach a prime under the prime factor concatenation procedure.A046423
Numbers requiring 3 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 4 steps to reach a prime under the prime factor concatenation procedure.A046424
Numbers requiring 4 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 5 steps to reach a prime under the prime factor concatenation procedure.A046425
Numbers requiring 5 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 6 steps to reach a prime under the prime factor concatenation procedure.A046426
Numbers requiring 6 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 7 steps to reach a prime under the prime factor concatenation procedure.A046427
Numbers requiring 7 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 8 steps to reach a prime under the prime factor concatenation procedure.A046428
Numbers requiring 8 steps to reach a prime under the prime factor concatenation procedure.
- Numbers requiring 9 steps to reach a prime under the prime factor concatenation procedure.A046429
Numbers requiring 9 steps to reach a prime under the prime factor concatenation procedure.
- Lengths of repunits with all prime factors ending with the digit 1.A046430
Lengths of repunits with all prime factors ending with the digit 1.
- Sum of digits of a(n) raised to its digits powers is prime.A046431
Sum of digits of a(n) raised to its digits powers is prime.
- 2 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046432
2 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- Numbers such that 3 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046433
Numbers such that 3 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- Numbers such that 4 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046434
Numbers such that 4 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- Numbers such that 5 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046435
Numbers such that 5 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- 6 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046436
6 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- 7 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046437
7 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- Numbers from which 8 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046438
Numbers from which 8 steps are needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- 9 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.A046439
9 steps needed to reach a prime under "Sum of digits raised to its digits' powers" procedure.
- Sum of digits of prime(n) raised to its digits' powers is prime.A046440
Sum of digits of prime(n) raised to its digits' powers is prime.
- Never reaches a prime under "Sum of digits raised to its digits' powers" procedure.A046441
Never reaches a prime under "Sum of digits raised to its digits' powers" procedure.
- Semiprimes whose two prime factors are distinct in length.A046442
Semiprimes whose two prime factors are distinct in length.
- Composite numbers whose 3 prime factors are distinct in length.A046443
Composite numbers whose 3 prime factors are distinct in length.
- Composite numbers whose 4 prime factors are distinct in length.A046444
Composite numbers whose 4 prime factors are distinct in length.
- Smallest composite with n prime factors that are distinct in length.A046445
Smallest composite with n prime factors that are distinct in length.
- Nonprimes whose prime factors contain only odd digits.A046446
Nonprimes whose prime factors contain only odd digits.
- Apart from initial term, composite numbers with the property that the concatenation of their prime factors is a palindrome.A046447
Apart from initial term, composite numbers with the property that the concatenation of their prime factors is a palindrome.
- Squarefree nonprimes with property that the concatenation of the prime factors is a palindrome.A046448
Squarefree nonprimes with property that the concatenation of the prime factors is a palindrome.
- Smallest composite number with n distinct prime factors with property that the concatenation of its distinct prime factors is a palindrome.A046449
Smallest composite number with n distinct prime factors with property that the concatenation of its distinct prime factors is a palindrome.
- Concatenation of prime factors of palindromic composite is a palindrome.A046450
Concatenation of prime factors of palindromic composite is a palindrome.
- Semiprimes whose prime factors, when concatenated, yield a palindrome.A046451
Semiprimes whose prime factors, when concatenated, yield a palindrome.
- Numbers that are the product of 3 prime factors whose concatenation is a palindrome.A046452
Numbers that are the product of 3 prime factors whose concatenation is a palindrome.
- Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.A046453
Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.
- Concatenation of the 5 prime factors of composite a(n) is a palindrome.A046454
Concatenation of the 5 prime factors of composite a(n) is a palindrome.
- Concatenation of the 6 prime factors of composite a(n) is a palindrome.A046455
Concatenation of the 6 prime factors of composite a(n) is a palindrome.
- Concatenation of the 7 prime factors of composite a(n) is a palindrome.A046456
Concatenation of the 7 prime factors of composite a(n) is a palindrome.
- Concatenation of the 8 prime factors of composite a(n) is a palindrome.A046457
Concatenation of the 8 prime factors of composite a(n) is a palindrome.
- Positive even integers that are not the sum of two nonprime odd integers.A046458
Positive even integers that are not the sum of two nonprime odd integers.
- Dudeney numbers: integers equal to the sum of the digits of their cubes.A046459
Dudeney numbers: integers equal to the sum of the digits of their cubes.
- Number of prime factors of concatenation of numbers from 1 up to n, with multiplicity.A046460
Number of prime factors of concatenation of numbers from 1 up to n, with multiplicity.