Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075526
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A075526
%S A075526 1,1,2,2,4,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,8,4,2,4,2,4,14,4,6,2,
%T A075526 10,2,6,6,4,6,6,2,10,2,4,2,12,12,4,2,4,6,2,10,6,6,6,2,6,4,2,10,14,4,2,
%U A075526 4,14,6,10,2,4,6,8,6,6,4,6,8,4,8,10,2,10,2,6,4,6,8,4,2,4,12,8,4,8,4,6
%N A075526 A008578(n+1) - A008578(n).
%C A075526 a(n) = A001223(n) for n>0.
%C A075526 n appears this number of times in A000720. - Lekraj Beedassy (blekraj(AT)yahoo.com), 
               Jun 19 2006
%Y A075526 Cf. A000040, A075527.
%Y A075526 Sequence in context: A106469 A082508 A163824 this_sequence A001223 A118776 
               A092520
%Y A075526 Adjacent sequences: A075523 A075524 A075525 this_sequence A075527 A075528 
               A075529
%K A075526 nonn
%O A075526 0,3
%A A075526 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 22 2002
%E A075526 a(0) = 1, for n >= 1: a(n) = differences between consecutive primes (A001223(n)) 
               = A158611(n+1) - A158611(n). Partial sums of a(n-1) = A006093(n) 
               for n >= 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), 
               Aug 04 2009]

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research