Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A128680
%S A128680 1,7,203,1379,11977,39991,577129,2359469,4780447,6521291,6640739,
%T A128680 9904979,21511301,28434413,34050611,113694413,189117439,222281549,
%U A128680 250163599,282046373,391803601,941748059,1269166759,1308225583
%N A128680 Numbers n such that n^3 divides 6^(n^2)+1.
%C A128680 7 divides a(n) for n>1.
%Y A128680 Cf. A127263 = numbers n such that n^3 divide 2^(n^2)+1. Cf. A128677 = 
               Least k>p such that (kp)^3 divides (p-1)^(kp)^2+1, where p = Prime[n]>
               2. Cf. A128678, A128679, A128681, A128682, A128683, A128684, A128685.
%Y A128680 Sequence in context: A154936 A057204 A124988 this_sequence A157775 A065819 
               A061028
%Y A128680 Adjacent sequences: A128677 A128678 A128679 this_sequence A128681 A128682 
               A128683
%K A128680 hard,nonn
%O A128680 1,2
%A A128680 Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 31 2007
%E A128680 More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Jan 13 2008

    
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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research