Vincenzo Manto is the authro of 19 integer sequences in the OEIS database.
His work has contributed to the field of integer sequences, ranging from Numbers whose number of nonzero digits is identical in base 2 and 3. (A393803) to Primes p for which floor(p / Pi) is prime. (A396945).
His most prolific partners include JamesC.Mchon.
These sequences have been cited by 21 other sequences, making him a 90-percentile contributor.
A393803: Numbers whose number of nonzero digits is identical in base 2 and 3.
Created: 4/14/2026 | Author: Vincenzo Manto , Mar 29 2026
Cited by: 1 sequences
Breakable numbers A394905: Smallest number k > n such that the binary Hamming distance between n and k is equal to the number of runs in the binary representation of n, and k has more runs than n.
Created: 4/15/2026 | Author: Vincenzo Manto , Apr 06 2026
Cited by: 1 sequences
A395344: a(n) is the integer obtained by inserting the sum (modulo 10) of adjacent digits of n between them.
Created: 4/25/2026 | Author: Vincenzo Manto , Apr 20 2026
Cited by: 1 sequences
A390002: Leading digit of 15^n.
Created: 10/27/2025 | Author: Vincenzo Manto , Oct 21 2025
Cited by: 2 sequences
A392375: Numbers k such that k is coprime to each of its digits and to the sum of its digits.
Created: 4/20/2026 | Author: Vincenzo Manto , Apr 06 2026
Cited by: 1 sequences
A395179: Maximum number of runs in the binary expansion of integers obtained by changing a single 0-bit to 1 in the binary representation of n considering bits up to and including the first leading 0.
Created: 5/4/2026 | Author: Vincenzo Manto , Apr 15 2026
Cited by: 1 sequences
A395542: Numbers whose number of nonzero digits is identical in base 2 and 5.
Created: 4/29/2026 | Author: Vincenzo Manto , Apr 28 2026
Cited by: 1 sequences
A395615: a(n) is the integer obtained by inserting the product (modulo 10) of adjacent digits of n between them.
Created: 5/7/2026 | Author: Vincenzo Manto , May 01 2026
Cited by: 1 sequences
A395743: Sum of the cumulative number of previous occurrences of the digits of n in the sequence 1..n excluding the current occurrence of each digit.
Created: 5/19/2026 | Author: Vincenzo Manto and James C. McMahon , May 05 2026
Cited by: 1 sequences
A395817: Strictly increasing minimal sequence where consecutive terms can be added digit-by-digit without carrying in base 10.
Created: 5/22/2026 | Author: Vincenzo Manto and James C. McMahon , May 07 2026
Cited by: 1 sequences
A396340: Primes prime(k) such that prime(k) - prime(k-1) is a Fibonacci number.
Created: 5/28/2026 | Author: Vincenzo Manto , May 23 2026
Cited by: 2 sequences
A396547: Primes p such that the sum of the distinct prime factors of p-1 is prime.
Created: 6/3/2026 | Author: Vincenzo Manto , May 28 2026
Cited by: 1 sequences
A394504: Numbers such that each digit d_i is equal to the number of digits to its right that are strictly less than d_i.
Created: 3/29/2026 | Author: Vincenzo Manto , Mar 22 2026
Cited by: 1 sequences
A395982: Primes p such that the Fermat quotient q = (2^(p-1) - 1)/p mod p satisfies 1 < q < p and q divides p - 1.
Created: 5/27/2026 | Author: Vincenzo Manto , May 13 2026
Cited by: 1 sequences
A396248: Primes prime(k) such that prime(k) - prime(k-1) is a factorial.
Created: 5/27/2026 | Author: Vincenzo Manto , May 20 2026
Cited by: 1 sequences
Planetary Numbers A396597: Numbers m with exactly two distinct prime factors q and p such that m = q^k * p^j and p > q^k with k, j >= 1.
Created: 6/8/2026 | Author: Vincenzo Manto and James C. McMahon , May 29 2026
Cited by: 1 sequences
A396898: Indices k such that prime(k) + 2*prime(k+1) is prime.
Created: 6/14/2026 | Author: James C. McMahon and Vincenzo Manto , Jun 09 2026
Cited by: 1 sequences
[Draft] A394735: Primes prime(k) such that prime(k+1) - prime(k) is a perfect power.
Created: 12/31/1 | Author: Vincenzo Manto , Jun 10 2026
Cited by: 1 sequences
[Draft] A396945: Primes p for which floor(p / Pi) is prime.
Created: 12/31/1 | Author: Vincenzo Manto , Jun 11 2026
Cited by: 1 sequences