|
Search: id:A096024
|
|
|
| A096024 |
|
Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1. |
|
+0
6
|
|
| 423, 1263, 2103, 2943, 3783, 4623, 5463, 6303, 7143, 7983, 8823, 9663, 10503, 11343, 12183, 13023, 13863, 14703, 15543, 16383, 17223, 18063, 18903, 19743, 20583, 21423, 22263, 23103, 23943, 24783, 25623, 26463, 27303, 28143, 28983, 29823
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Numbers n such that n mod 840 = 423.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
EXAMPLE
|
423 mod 2 = 424 mod 3 = 425 mod 4 = 426 mod 5 = 427 mod 6 = 428 mod 7 = 1 and 429 mod 8 = 5, hence 423 is in the sequence.
|
|
PROGRAM
|
(PARI) {k=6; m=30000; 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, A096025, A096026, A096027.
Sequence in context: A083193 A109505 A109473 this_sequence A091293 A134218 A091292
Adjacent sequences: A096021 A096022 A096023 this_sequence A096025 A096026 A096027
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 15 2004
|
|
|
Search completed in 0.002 seconds
|
