Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096025
%S A096025 843,1683,3363,4203,5883,6723,8403,9243,10923,11763,13443,14283,15963,
%T A096025 16803,18483,19323,21003,21843,23523,24363,26043,26883,28563,29403,
%U A096025 31083,31923,33603,34443,36123,36963,38643,39483,41163,42003,43683
%N A096025 Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 
               9 <> 1.
%C A096025 Numbers n such that n mod 840 = 3 and n mod 2520 <> 3.
%e A096025 843 mod 2 = 844 mod 3 = 845 mod 4 = 846 mod 5 = 847 mod 6 = 848 mod 7 
               = 849 mod 8 = 1 and 850 mod 9 = 4, hence 843 is in the sequence.
%o A096025 (PARI) {k=7;m=44000;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,",")))}
%Y A096025 Cf. A007310, A017629, A096022, A096023, A096024, A096026, A096027.
%Y A096025 Sequence in context: A093242 A031527 A045243 this_sequence A004949 A004969 
               A031707
%Y A096025 Adjacent sequences: A096022 A096023 A096024 this_sequence A096026 A096027 
               A096028
%K A096025 nonn,easy
%O A096025 1,1
%A A096025 Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 15 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research