Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088823
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A088823
%S A088823 0,2,5,7,12,1,1,1,1,4,1,1,1,2,1,1,6,1,1,1,4,1,1,1,2,1,1,1,2,1,1,1,3,4,
               1,
%T A088823 3,1,2,3,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,10,1,1,1,2,
%U A088823 29,1,1,2,1,7,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,3,1,1,2,1,5,1,14,1,1
%N A088823 a(n) = GCD of the sum of largest prime factors of numbers from 1 to n 
               and of the sum of smallest prime factors of numbers from 1 to n.
%F A088823 a(n)=GCD[A088821(n), A088822(n)]
%Y A088823 Cf. A088821-A088825.
%Y A088823 Sequence in context: A141064 A131102 A039679 this_sequence A007445 A159699 
               A063217
%Y A088823 Adjacent sequences: A088820 A088821 A088822 this_sequence A088824 A088825 
               A088826
%K A088823 nonn
%O A088823 1,2
%A A088823 Labos E. (labos(AT)ana.sote.hu), Oct 22 2003

    
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 6 19:58 EST 2009. Contains 170429 sequences.


AT&T Labs Research