Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096027
%S A096027 27723,55443,83163,110883,138603,166323,194043,221763,249483,277203,
%T A096027 304923,332643,388083,415803,443523,471243,498963,526683,554403,582123,
%U A096027 609843,637563,665283,693003,748443,776163,803883,831603,859323,887043
%N A096027 Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 10 and (n+11) 
               mod 13 <> 1.
%C A096027 Numbers n such that n mod 27720 = 3 and n mod 360360 <> 3.
%e A096027 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.
%o A096027 (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,",")))}
%Y A096027 Cf. A007310, A017629, A096022, A096023, A096024, A096025, A096026.
%Y A096027 Sequence in context: A023198 A068404 A023943 this_sequence A058419 A046333 
               A116462
%Y A096027 Adjacent sequences: A096024 A096025 A096026 this_sequence A096028 A096029 
               A096030
%K A096027 nonn,easy
%O A096027 1,1
%A A096027 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research