Sequence Machine

If a conjecture has value, feel free to submit it to the OEIS! Before submitting: - Verify and try to prove the conjecture - Possibly adjust offsets - Read through the OEIS guidelines oeis.org

If you are into bit-twiddling, this one is pretty neat and probably provable: A292531 a(n) = 0 if n is a power of 2. Otherwise, product of 2 numbers nearest n that have more 2's in their prime factorization than n. Is a(n)=and(n²-1, n²) ?

So far, the majority of the ~2k posted conjectures are for OEIS entries without a formula field. There are approximately 22k more of this type queued up, but it appears that the bot has been suspended by twitter's new policy... I will resort to some manual postings until fixed.

Index of prime(n) in A090252. oeis.org/A354148 Is a(n)=comp[A354164(abs(1-n)+1)-1]+1? sequencedb.net/?s=A354148

Coordination sequence Gal.6.625.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings. oeis.org/A314194 Is a(n)=abs(A008592(n)-A314752(n))? sequencedb.net/?s=A314194

Integers in (2+A191127)/4; contains A191127 as a proper subsequence. oeis.org/A191179 Is a(n)=round(A191207(n+1)/2)? sequencedb.net/?s=A191179

Number of (w,x,y,z) with all terms in {1,...,n} and w^2>=x^2+y^2+z^2. oeis.org/A212095 Is a(n)=A212094(n)+A212091(n)? sequencedb.net/?s=A212095

Numbers divisible by their last digit. oeis.org/A034709 Is a(n)=eq[lcm(n, A010879(n)), A028310(n)]? sequencedb.net/?s=A034709

Convolution of A014306 with itself. oeis.org/A023673 Is a(n)=A025128(round(sqrt(n²+1)))+A024695(n+1)? sequencedb.net/?s=A023673

a(n)=T(n,1), array T as in A049735. oeis.org/A049744 Is a(n)=A333167(n)+A000328(n)? sequencedb.net/?s=A049744

Numbers n such that 11n-1 and 11n+1 are twin primes. oeis.org/A175152 Is a(n)=∩[A102656(n+1), A107960(n+1)]? sequencedb.net/?s=A175152

Coordination sequence Gal.5.120.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings. oeis.org/A316003 Is a(n)=A316002(n)+A316019(n)-A316049(n)? sequencedb.net/?s=A316003

a(n) = round(log_3(n)). oeis.org/A329199 Is a(n)=∑[char[A022838(3^n)]]? sequencedb.net/?s=A329199

Numbers such that the greatest prime divisor is less than the product of the other distinct prime divisors. oeis.org/A212666 Is a(n)=lt[rad(n+1), A051119(A007947(n+1))²]+1? sequencedb.net/?s=A212666

3rd column of array in A038150. oeis.org/A047925 Is a(n)=A188471(n+1)+3? sequencedb.net/?s=A047925

Partial sums of decimal digits of Pi (ignoring the initial 3). oeis.org/A039918 Is a(n)=Δ[A227844(n+3)]-4? sequencedb.net/?s=A039918

Fixed point of the morphism 1 -> 131, 2 -> 312, 3 -> 2. oeis.org/A227339 Is a(n)=xor(1, Δ[A064437(A008619(n))])? sequencedb.net/?s=A227339

a(n) = Sum_{p | A055204(n)} 2^(pi(p) - 1). oeis.org/A336510 Is a(n)=xor(a(n-1), A248663(n+1))? sequencedb.net/?s=A336510

Number of active (ON,black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood. oeis.org/A270214 Is a(n)=A270216(n-1)+a(n-1)? sequencedb.net/?s=A270214

Numbers k such that floor[(k-1/2)*(2+2^(1/2))+1/2] is prime. oeis.org/A184869 Is a(n)=A194920(p?[A081477(2*n+1)])? sequencedb.net/?s=A184869

Expansion of 1/((1-x)*(1-x^3)*(1-x^10)*(1-x^12)). oeis.org/A029061 Is a(n)=∑[A025857(n)]? sequencedb.net/?s=A029061