Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088934
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A088934
%S A088934 19,13,19,13,2,3,13,19,13,3,13,7,5,3,13,7,5,13,13,7,5,5,19,13,7,5,13,13,
%T A088934 7,5,5,19,13,7,5,13,7,7,5,13,7,17,11,11,7,7,17,11,13,7,17,11,13,7,7,17,
%U A088934 11,13,7,11,11,7,7,11,13,7,17,11,11,7,7,17,11,13,7,17,11,11,7,7,17,11
%N A088934 Maximum prime required for the representation of n by a signed sum of 
               squares of distinct primes that has the minimal number of terms A088910(n).
%e A088934 See example in A088910.
%Y A088934 Cf. A089294 representation minimizing the maximum occurring prime instead 
               of minimizing the number of terms, A089297 representation of the 
               squares of primes by squares of distinct other primes.
%Y A088934 Sequence in context: A083156 A040344 A089294 this_sequence A155848 A088399 
               A106706
%Y A088934 Adjacent sequences: A088931 A088932 A088933 this_sequence A088935 A088936 
               A088937
%K A088934 nonn
%O A088934 0,1
%A A088934 Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 06 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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research