Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082562
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082562
%S A082562 1,2,4,8,15,24,35,48,63,80,99,120,143,168,195,224,255,288,323,360,399,
%T A082562 440,483,528,575,624,675,728,783,840,899,960,1023,1088,1155,1224,1295,
%U A082562 1368,1443,1520,1599,1680,1763,1848,1935,2024,2115,2208,2303,2400,2499
%N A082562 a(n)= number of values of m such that m can be expressed as the sum of 
               distinct odd numbers with largest odd number in the sum = 2n+1.
%F A082562 For n>2, a(n) = n^2-1. The values of m are all values from 2n+1 to (n+1)^2 
               except 2n+3 and n^2+2n-1. - David Wasserman (wasserma(AT)spawar.navy.mil), 
               Sep 16 2004
%Y A082562 Cf. A082548, A082547.
%Y A082562 Sequence in context: A033623 A094398 A026474 this_sequence A159243 A089140 
               A000125
%Y A082562 Adjacent sequences: A082559 A082560 A082561 this_sequence A082563 A082564 
               A082565
%K A082562 easy,nonn
%O A082562 0,2
%A A082562 Naohiro Nomoto (n_nomoto(AT)yabumi.com), May 05 2003
%E A082562 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Sep 16 
               2004

    
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 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research