|
Search: id:A096026
|
|
|
| A096026 |
|
Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 8 and (n+9) mod 11 <> 1. |
|
+0
6
|
|
| 2523, 5043, 7563, 10083, 12603, 15123, 17643, 20163, 22683, 25203, 30243, 32763, 35283, 37803, 40323, 42843, 45363, 47883, 50403, 52923, 57963, 60483, 63003, 65523, 68043, 70563, 73083, 75603, 78123, 80643, 85683, 88203, 90723, 93243
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Numbers n such that n mod 2520 = 3 and n mod 27720 <> 3.
|
|
EXAMPLE
|
2523 mod 2 = 2524 mod 3 = 2525 mod 4 = 2526 mod 5 = 2527 mod 6 = 2528 mod 7 = 2529 mod 8 = 2530 mod 9 = 2531 mod 10 = 1 and 2532 mod 11 = 2, hence 2523 is in the sequence.
|
|
PROGRAM
|
(PARI) {k=9; m=95000; 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, A096027.
Sequence in context: A123485 A144971 A045942 this_sequence A031984 A045213 A111729
Adjacent sequences: A096023 A096024 A096025 this_sequence A096027 A096028 A096029
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 15 2004
|
|
|
Search completed in 0.002 seconds
|
