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.

A116226 n times n+2 gives the concatenation of two numbers m and m-9.

Original entry on oeis.org

4622, 5377, 7980, 34952, 46865, 53134, 65047, 7056186, 9783459, 43176670, 56823329, 97999800, 447255476452, 552744523547, 755424659534, 799319866013, 997999998000, 4297663349523, 5702336650476, 6971253996227
Offset: 1

Views

Author

Giovanni Resta, Feb 06 2006

Keywords

Examples

			97999800 * 97999802 = 96039609//96039600, where // denotes
concatenation.
		

Crossrefs

Programs

  • Maple
    A:= NULL: count:= 0:
    for d from 2 to 40 do
      R:= [msolve(x^2=-8,10^d+1)];
      T:= sort(select(t -> t*(t+2) mod 10^d >= 10^(d-1), map(t -> subs(t,x-1),R)));
      count:= count+nops(T);
      A:= A, op(T);
    od:
    A; # Robert Israel, Jan 04 2021