Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075319
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A075319
%S A075319 4,14,20,30,40,46,56,62,72,82,88,98,108,114,124,130,140,150,156,166,172,
%T A075319 182,192,198,208,218,224,234,240,250,260,266,276,286,292,302,308,318,
%U A075319 328,334,344,350,360,370,376,386,396,402,412,418,428,438,444,454,460
%N A075319 Pair the odd numbers such that the k-th pair is (r, r+2k) where r is 
               the smallest odd number not included earlier: (1,3),(5,9),(7,13),
               (11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence 
               of the sum of the members of pairs.
%F A075319 a(n)=A075317(n)+A075318(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 12 2006
%p A075319 A075319 := proc(nmax) local r,k,a,pairs ; a := [4] ; pairs := [1,3] ; 
               k := 2 ; r := 5 ; while nops(a) < nmax do while r in pairs do r := 
               r+2 ; od ; if r+2*k in pairs then printf("inconsistency",k) ; fi 
               ; a := [op(a),2*(r+k)] ; pairs := [op(pairs),r,r+2*k] ; k := k+1 
               ; od ; RETURN(a) ; end: a := A075319(200) : for n from 1 to nops(a) 
               do printf("%d,",op(n,a)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 12 2006
%Y A075319 Cf. A075317, A075318, A075320.
%Y A075319 Sequence in context: A035401 A139330 A051448 this_sequence A030470 A165721 
               A051806
%Y A075319 Adjacent sequences: A075316 A075317 A075318 this_sequence A075320 A075321 
               A075322
%K A075319 nonn
%O A075319 1,1
%A A075319 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 14 2002
%E A075319 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 12 2006

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research