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.

A285079 Oblong numbers the product of whose digits are positive oblong numbers.

This page as a plain text file.
%I A285079 #17 Apr 15 2017 09:23:00
%S A285079 2,6,12,56,132,156,756,2756,4556,6162,6972,7656,13572,21756,31152,
%T A285079 33672,45156,61752,84972,153272,166872,279312,467172,626472,661782,
%U A285079 1273512,1412532,1541322,1568756,1596432,1786232,1867322,2678132,2817362,3416952,3521252
%N A285079 Oblong numbers the product of whose digits are positive oblong numbers.
%C A285079 Oblong numbers are numbers of the form k*(k+1) (A002378).
%H A285079 Robert Israel and Giovanni Resta, <a href="/A285079/b285079.txt">Table of n, a(n) for n = 1..391</a> (terms < 10^25, first 221 terms from Robert Israel)
%p A285079 filter:= proc(x) local t; t:= convert(convert(x,base,10),`*`);
%p A285079 t > 0 and issqr(1+4*t); end proc:
%p A285079 select(filter, [seq(x*(1+x),x=1..10^4)]); # _Robert Israel_, Apr 14 2017
%t A285079 f[x_] := Sqrt[1 + 4 (Times @@ IntegerDigits[x])]; Select[Table[n (n + 1), {n, 1, 10000}], f[#] > 1 && Mod[f[#], 2] == 1 &]
%Y A285079 Cf. A002378, A053059, A069077.
%K A285079 nonn,base
%O A285079 1,1
%A A285079 _Melvin Peralta_, Apr 09 2017