Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128165
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A128165
%S A128165 1,2,6,10,20,22,28,155,488,664,992,6162,7840,7975,8793,18961,32422,
%T A128165 148220,231625,332198,459121,462932,2115894,8108930,10336641,11789731,
%U A128165 15500046,23483195,46571611,48582404,77033887,105390951,132421841
%N A128165 Numbers n such that n divides 1 + Sum[ Prime[k], {k,1,n} ] = 1 + A007504(n).
%t A128165 s = 1; Do[s = s + Prime[n]; If[ Mod[s, n] == 0, Print[n]], {n, 2115894}]
%Y A128165 Cf. A000040, A007504, A045345, A128166, A128167, A128168, A128169, A128170, 
               A128171.
%Y A128165 Sequence in context: A005993 A028247 A065054 this_sequence A097646 A077084 
               A007926
%Y A128165 Adjacent sequences: A128162 A128163 A128164 this_sequence A128166 A128167 
               A128168
%K A128165 hard,nonn
%O A128165 1,2
%A A128165 Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 22 2007, extended Feb 
               22 2007
%E A128165 More terms from Ryan Propper (rpropper(AT)stanford.edu), Apr 05 2007

    
page 1

Search completed in 0.001 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research