|
Search: id:A117323
|
|
|
| A117323 |
|
Semiprime(n) modulo prime(n). |
|
+0
1
|
|
| 0, 0, 4, 3, 3, 2, 4, 3, 2, 26, 2, 34, 35, 1, 39, 46, 49, 51, 55, 57, 58, 62, 65
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
After a(14), it is always true that prime(n) > semiprime(n), so that a(n) = semiprime(n).
|
|
FORMULA
|
a(n) = A001358(n) modulo A000040(n).
|
|
EXAMPLE
|
a(1) = 4 mod 2 = 0.
a(2) = 6 mod 3 = 0
a(3) = 9 mod 5 = 4.
a(4) = 10 mod 7 = 3.
|
|
CROSSREFS
|
Adjacent sequences: A117320 A117321 A117322 this_sequence A117324 A117325 A117326
Sequence in context: A019975 A073871 A120927 this_sequence A016502 A117691 A143487
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 08 2006
|
|
|
Search completed in 0.002 seconds
|
