Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024398
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024398 a(n) = [ (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+1 positive integers congruent to 2 mod 3}. +0
1
0, 1, 4, 8, 14, 22, 31, 41, 53, 67, 82, 98, 116, 136, 157, 179, 203, 229, 256, 284, 314, 346, 379, 413, 449, 487, 526, 566, 608, 652, 697, 743, 791, 841, 892, 944, 998, 1054, 1111, 1169, 1229, 1291, 1354, 1418, 1484 (list; graph; listen)
OFFSET

1,3

FORMULA

(1/4) {3(n^2-n-1) - (-1)^[n/2] }, n>1. - Ralf Stephan, Jun 09 2005

CROSSREFS

Adjacent sequences: A024395 A024396 A024397 this_sequence A024399 A024400 A024401

Sequence in context: A122224 A004797 A053459 this_sequence A054347 A003682 A011897

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research