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.

A107626 Numbers n such that every digit of both n and n^2 contains a loop (only digits 0,4,6,8,9 in n and n^2).

This page as a plain text file.
%I A107626 #8 Sep 09 2019 10:58:19
%S A107626 8,64,80,98,640,664,800,898,980,998,6400,6640,6664,8000,8980,8998,
%T A107626 9800,9980,9998,64000,66400,66640,66664,80000,89800,89980,89998,98000,
%U A107626 98998,99800,99980,99998,640000,664000,664064,666400,666640,666664,684908,800000,806008
%N A107626 Numbers n such that every digit of both n and n^2 contains a loop (only digits 0,4,6,8,9 in n and n^2).
%C A107626 Corresponding squares in A107627. Cf. A001744 Every digit contains a loop.
%t A107626 Do[id=Union[IntegerDigits[n^2], IntegerDigits[n]];If[Count[id, 1]+Count[id, 2]+Count[id, 3]+Count[id, 5]+Count[id, 7]==0, Print[n]], {n, 10000}]
%o A107626 (PARI) is_a001744(n) = #setintersect(vecsort(digits(n), , 8), [1, 2, 3, 5, 7])==0
%o A107626 is(n) = is_a001744(n) && is_a001744(n^2) \\ _Felix Fröhlich_, Sep 09 2019
%Y A107626 Cf. A001744, A107624, A107625, A107627.
%K A107626 nonn,base,dumb
%O A107626 1,1
%A A107626 _Zak Seidov_, May 18 2005
%E A107626 More terms from _Felix Fröhlich_, Sep 09 2019