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.

A162422 Numbers with at least 2 different numbers of digits among their prime factors.

This page as a plain text file.
%I A162422 #6 Oct 01 2013 21:35:30
%S A162422 22,26,33,34,38,39,44,46,51,52,55,57,58,62,65,66,68,69,74,76,77,78,82,
%T A162422 85,86,87,88,91,92,93,94,95,99,102,104,106,110,111,114,115,116,117,
%U A162422 118,119,122,123,124,129,130,132,133,134,136,138,141,142,145,146,148,152
%N A162422 Numbers with at least 2 different numbers of digits among their prime factors.
%C A162422 Complement of A162421. There are no prime numbers in this sequence.
%C A162422 These numbers can also be called factor rough numbers.
%C A162422 Basically, the number of digits of A020639(k) and of A006530(k) must differ to admit k into the sequence.
%F A162422 {k >1: A055642(A020639(k)) <> A055642(A006530(k)) }. - R. J. Mathar, Sep 16 2009
%e A162422 1111 = 11*101 has factors with different digital lengths. Also it is the first occurrence that differs from A084891.
%o A162422 (PARI) factorrough(m,n) =
%o A162422 {
%o A162422 local(x,a,j,f,ln);
%o A162422 for(x=m,n, f=0; a = ifactor(x); for(j=2,length(a), ln=length(Str(a[j-1])); if(length(Str(a[j]))!=ln,f=1;break);); if(f,print1(x",")););
%o A162422 }
%Y A162422 Cf. A084891, A162457
%K A162422 base,nonn
%O A162422 1,1
%A A162422 _Cino Hilliard_, Jul 03 2009
%E A162422 Offset set to 1, definition shortened - _R. J. Mathar_, Sep 16 2009