cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Travis Vasquez

Travis Vasquez's wiki page.

Travis Vasquez has authored 1 sequences.

A379591 Numbers k whose base-10 digits can be split into two parts, q and r, with k = (|q-r|)^3.

Original entry on oeis.org

1000, 456533, 474552, 1000000, 69426531, 1000000000, 1000000000000, 1000000000000000, 1000000000000000000, 1000000000000000000000, 1000000000000000000000000, 1000000000000000000000000000, 1000000000000000000000000000000, 1000000000000000000000000000000000
Offset: 1

Author

Travis Vasquez, Dec 26 2024

Keywords

Examples

			1000 = (|10-00|)^3.
456533 = (|456-533|)^3.
1000000 = (|100-0000|)^3.
		

Crossrefs

Programs

  • Maple
    filter:= proc(x) local m;
    for m from 1 to ilog10(x) do
      if x = abs((x mod 10^m) - floor(x/10^m))^3 then return true fi
    od;
    false
    end proc:
    select(filter, [seq(i^3,i=1..10^7)]); # Robert Israel, Jan 01 2025
  • PARI
    lista(nn) = my(d, m, q, s, t=1, v=List([])); while(t1&&gcd(f[1], (t+1)/f[1])==1, d=[x[1]^x[2]|x<-f[2]~]; forvec(x=vector(#d, i, [0, 1]), s=lift(chinese(chinese(vector(#d, i, Mod((-1)^x[i], d[i]))), Mod(0, (t+1)/f[1]))); q=(s^3-s)/(t+1); if(q>0&&s+q=s&&q-sx<=nn, v)); \\ Jinyuan Wang, Jan 03 2025

Extensions

a(11)-a(12) from Michael S. Branicky, Jan 01 2025
a(13)-a(14) from Jinyuan Wang, Jan 03 2025