|
Search: id:A064219
|
|
|
| A064219 |
|
a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer. |
|
+0
1
|
|
| 1, 1, 2, 3, 15, 24, 35, 119, 504, 720, 2519, 2519, 41040, 83160, 83160, 196559, 524160, 524160, 3160079, 3160079, 3160079, 3160079, 68468400, 68468400, 68468400, 68468400, 4724319600, 4724319600, 26702675999, 26702675999
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(5)=15 because (2 divides a(5)+1) and (3 divides a(5)) and (4 divides a(5)+1) and (5 divides a(5))
|
|
PROGRAM
|
(PARI) { a=1; for (n=1, 100, if (a%n && (a+1)%n, until (b, b=1; a++; for (k=1, n, if (a%k && (a+1)%k, b=0; break)))); write("b064219.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 10 2009]
|
|
CROSSREFS
|
Sequence in context: A048613 A162890 A030072 this_sequence A124164 A060753 A143880
Adjacent sequences: A064216 A064217 A064218 this_sequence A064220 A064221 A064222
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Don Reble (djr(AT)nk.ca), Sep 21 2001
|
|
|
Search completed in 0.002 seconds
|
