Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137167 Semiprimes that do not contain any other semiprimes as a substring. +0
1
4, 6, 9, 10, 15, 21, 22, 25, 33, 35, 38, 51, 55, 57, 58, 77, 82, 85, 87, 111, 118, 123, 178, 183, 201, 202, 203, 205, 237, 278, 301, 302, 303, 305, 323, 327, 371, 501, 502, 505, 527, 537, 703, 707, 713, 717, 718, 723, 731, 737, 753, 781, 802, 803, 807, 813, 817 (list; graph; listen)
OFFSET

1,1

COMMENT

Semiprime analogue of A033274. If there is more than one digit, all digits must be nonsemiprime numbers {0,1,2,3,5,7,8}.

EXAMPLE

Start with all semiprimes and sieve out the ones which have semiprime substrings. Semiprime A001358(5) = 14 is not in this sequence because it contains the digit "4" which is semiprime A001358(1). Semiprime A001358(35) = 106 is not in this sequence because it contains the digit "6" which is semiprime A001358(2), and also contains as substring "10" which is semiprime A001358(4).

MAPLE

isA001358 := proc(n) if numtheory[bigomega](n) = 2 then true ; else false ; fi ; end: Lton := proc(L) local a, i; a :=0 ; for i from 1 to nops(L) do a := 10*a+op(i, L) ; od: a ; end: isA137167 := proc(n) local dgs, strti, endi ; if isA001358(n) then dgs := ListTools[Reverse](convert(n, base, 10)) ; for strti from 1 to nops(dgs) do for endi from strti to nops(dgs) do if strti > 1 or endi < nops(dgs) then if isA001358(Lton([op(strti..endi, dgs)])) then RETURN(false) : fi ; fi ; od: od: RETURN(true) ; else RETURN(false) ; fi ; end: for n from 1 to 1600 do if isA137167(n) then printf("%d, ", n) ; fi ; od: - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 12 2008

CROSSREFS

Cf. A001358, A033274, A107342.

Adjacent sequences: A137164 A137165 A137166 this_sequence A137168 A137169 A137170

Sequence in context: A010462 A028957 A084662 this_sequence A122492 A133234 A111206

KEYWORD

base,easy,nonn,less

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 03 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 12 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research