|
Search: id:A096027
|
|
|
| A096027 |
|
Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 10 and (n+11) mod 13 <> 1. |
|
+0
6
|
|
| 27723, 55443, 83163, 110883, 138603, 166323, 194043, 221763, 249483, 277203, 304923, 332643, 388083, 415803, 443523, 471243, 498963, 526683, 554403, 582123, 609843, 637563, 665283, 693003, 748443, 776163, 803883, 831603, 859323, 887043
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Numbers n such that n mod 27720 = 3 and n mod 360360 <> 3.
|
|
EXAMPLE
|
27723 mod 2 = 27724 mod 3 = 27725 mod 4 = 27726 mod 5 = 27727 mod 6 = 27728 mod 7 = 27729 mod 8 = 27730 mod 9 = 27731 mod 10 = 27731 mod 11 = 27731 mod 12 = 1 and 27732 mod 13 = 3, hence 27723 is in the sequence.
|
|
PROGRAM
|
(PARI) {k=11; m=900000; for(n=1, m, j=0; b=1; while(b&&j<k, if((n+j)%(2+j)==1, j++, b=0)); if(b&&(n+k)%(2+k)!=1, print1(n, ", ")))}
|
|
CROSSREFS
|
Cf. A007310, A017629, A096022, A096023, A096024, A096025, A096026.
Sequence in context: A023198 A068404 A023943 this_sequence A058419 A046333 A116462
Adjacent sequences: A096024 A096025 A096026 this_sequence A096028 A096029 A096030
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 15 2004
|
|
|
Search completed in 0.002 seconds
|
