Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131174
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131174 a(2n) = 2*A000217(n), a(2n+1) = A000217(n). +0
1
0, 0, 2, 1, 6, 3, 12, 6, 20, 10, 30, 15, 42, 21, 56, 28, 72, 36, 90, 45, 110, 55, 132, 66, 156, 78, 182, 91, 210, 105, 240, 120, 272, 136, 306, 153, 342, 171, 380, 190, 420, 210, 462, 231, 506, 253, 552, 276, 600, 300, 650, 325, 702, 351, 756, 378, 812, 406, 870, 435 (list; graph; listen)
OFFSET

0,3

MAPLE

A000217 := proc(n) n*(n+1)/2 ; end: A131174 := proc(n) if n mod 2 = 0 then 2*A000217(n/2) ; else A000217((n-1)/2) ; fi ; end: seq(A131174(n), n=0..90) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 26 2007

CROSSREFS

Sequence in context: A026191 A050137 A086111 this_sequence A135994 A133166 A051482

Adjacent sequences: A131171 A131172 A131173 this_sequence A131175 A131176 A131177

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Sep 24 2007

EXTENSIONS

Edited by njas, Sep 27 2007

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 26 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research