Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082772
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082772
%S A082772 8,14,15,20,24,26,27,32,35,38,39,44,48,50,51,56,62,63,64,65,68,74,75,80,
%T A082772 84,86,87,90,92,95,98,99,104,110,111,116,119,120,122,123,124,125,128,
%U A082772 132,134,135,140,143,144,146,147,152,155,158,159,164,168,170,171,174
%N A082772 Integers n such that there exists at least one divisor p of n, 1 < p 
               < n, such that p divides n and p+1 divides n+1.
%e A082772 24 is contained in sequence a since 4 divides 24 and 5 divides 25
%o A082772 Programmed in C++ for (int a = 1; a < 200; a++) for (int b = 2; b < a; 
               b++) if ((a%b==0)&&((a+1)%(b+1)==0)) cout << a << ", "; // outputs 
               a
%Y A082772 Sequence in context: A109847 A122459 A092537 this_sequence A103338 A050681 
               A084021
%Y A082772 Adjacent sequences: A082769 A082770 A082771 this_sequence A082773 A082774 
               A082775
%K A082772 easy,nonn
%O A082772 1,1
%A A082772 Anne M. Donovan (anned3005(AT)aol.com) May 21 2003

    
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 December 5 17:24 EST 2009. Contains 170342 sequences.


AT&T Labs Research