Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039915
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039915
%S A039915 3,2,4,6,10,12,16,18,22,28,30,36,40,42,46,52,58,60,66,70,72,78,82,88,96,
%T A039915 100,102,106,108,112,126,130,136,138,148,150,156,162,166,172,178,180,
%U A039915 190,192,196,198,210,222,226,228,232,238,240,250,256,262,268,270
%N A039915 Smallest k such that k(p-1)-1 is positive and divisible by p where p 
               = n-th prime.
%C A039915 Also smallest positive k such that the k-th triangular number is divisible 
               by the n-th prime. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Apr 19 2002
%H A039915 T. D. Noe, <a href="b039915.txt">Table of n, a(n) for n=1..1000</a>
%F A039915 a(n) = p+(-1)^p. - Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), May 
               26 2009
%e A039915 a(1)=3 because 3(2-1)-1=2 is divisible by 2.
%Y A039915 Cf. A000217, A039678. Essentially the same as A006093.
%Y A039915 Sequence in context: A019653 A095258 A114745 this_sequence A085346 A121861 
               A060006
%Y A039915 Adjacent sequences: A039912 A039913 A039914 this_sequence A039916 A039917 
               A039918
%K A039915 nice,nonn
%O A039915 1,1
%A A039915 Felice Russo (felice.russo(AT)katamail.com)
%E A039915 Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), 
               Jun 06 2008

    
page 1

Search completed in 0.004 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