Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131317
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131317 Repdigit semiprimes. +0
1
22, 33, 55, 77, 111, 1111, 11111, 1111111, 11111111111, 11111111111111111, 2222222222222222222, 3333333333333333333, 5555555555555555555, 7777777777777777777, 22222222222222222222222, 33333333333333333333333 (list; graph; listen)
OFFSET

1,1

COMMENT

A semiprime can be repdigit (base 10) in only two ways. It can be a repunit semiprime (A102782) or it can be a repunit prime times a prime digit {2, 3, 5, 7}. Subset of A046328. Subset of A116063. Occurs in proof that the sequence is infinite in which a(n) is the least semiprime > a(n-1) such that a(n) has no digit in common with a(n-1).

FORMULA

A102782 UNION 2*A004022 UNION 3*A004022 UNION 5*A004022 UNION 7*A004022.

EXAMPLE

a(1) = 22 = 2 * 11;

a(2) = 33 = 3 * 11;

a(3) = 55 = 5 * 11;

a(4) = 77 = 7 * 11;

a(5) = 111 = 3 * 37;

a(6) = 1111 = 11 * 101;

a(7) = 11111 = 41 * 271.

CROSSREFS

Cf. A000042, A001358, A004023, A046413, A046328, A102782, A116063.

Sequence in context: A120146 A138840 A116063 this_sequence A067087 A155709 A095044

Adjacent sequences: A131314 A131315 A131316 this_sequence A131318 A131319 A131320

KEYWORD

base,easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 21 2007

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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research