Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065530
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065530 If n is odd then a(n) = n, else a(n) = n*(n+2). +0
1
0, 1, 8, 3, 24, 5, 48, 7, 80, 9, 120, 11, 168, 13, 224, 15, 288, 17, 360, 19, 440, 21, 528, 23, 624, 25, 728, 27, 840, 29, 960, 31, 1088, 33, 1224, 35, 1368, 37, 1520, 39, 1680, 41, 1848, 43, 2024, 45, 2208, 47, 2400, 49, 2600, 51, 2808, 53, 3024, 55, 3248, 57 (list; graph; listen)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,1000

FORMULA

O.g.f.: (x+8x^2-x^5)/(1-x^2)^3. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Dec 04 2001

PROGRAM

(PARI) { for (n=0, 1000, if (n%2, a=n, a=n*(n + 2)); write("b065530.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 20 2009]

CROSSREFS

Sequence in context: A070486 A144433 A037206 this_sequence A137481 A004734 A049074

Adjacent sequences: A065527 A065528 A065529 this_sequence A065531 A065532 A065533

KEYWORD

easy,nonn

AUTHOR

George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 02 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Dec 04 2001

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research