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.

A208261 Nonprime numbers with all divisors starting and ending with digit 1.

This page as a plain text file.
%I A208261 #11 Nov 21 2013 13:07:47
%S A208261 1,121,1111,1331,1441,1661,1991,10201,11231,11341,11561,11671,12001,
%T A208261 12221,12661,12881,12991,13211,13231,13541,14201,14311,14531,14641,
%U A208261 14971,15191,15251,15851,15961,16181,16291,16621,16841,17161,17281,17611,17831,18271,18281
%N A208261 Nonprime numbers with all divisors starting and ending with digit 1.
%C A208261 Complement of A062332 with respect to A208262. Subsequence of A208260 (nonprime numbers starting and ending with digit 1).
%H A208261 Harvey P. Dale, <a href="/A208261/b208261.txt">Table of n, a(n) for n = 1..3000</a>
%e A208261 Divisors of 1111: 1, 11, 101, 1111.
%t A208261 Select[Table[n, {n, 20000}], ! PrimeQ[#] && Union[First /@ IntegerDigits[Divisors[#]]] == {1} && Union[Last /@ IntegerDigits[Divisors[#]]] == {1} &] (* _Vladimir Joseph Stephan Orlovsky_, Feb 26 2012 *)
%t A208261 d1Q[n_]:=Module[{idn=IntegerDigits[n]},First[idn]==Last[idn]==1]; Select[ Range[1,20000,10],!PrimeQ[#]&&Count[Divisors[#],_?d1Q] == DivisorSigma[ 0,#]&] (* _Harvey P. Dale_, Nov 23 2012 *)
%Y A208261 Cf. A208262 (numbers with all divisors starting and ending with digit 1), A062332 (primes starting and ending with digit 1).
%K A208261 nonn,base
%O A208261 1,2
%A A208261 _Jaroslav Krizek_, Feb 24 2012