Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066070 a(1) = 1; for m > 0, a(2m) = 2(2m+1), a(2m+1) = 2m+1. +0
1
1, 6, 3, 10, 5, 14, 7, 18, 9, 22, 11, 26, 13, 30, 15, 34, 17, 38, 19, 42, 21, 46, 23, 50, 25, 54, 27, 58, 29, 62, 31, 66, 33, 70, 35, 74, 37, 78, 39, 82, 41, 86, 43, 90, 45, 94, 47, 98, 49, 102, 51, 106, 53, 110, 55, 114, 57, 118, 59, 122, 61, 126, 63, 130, 65, 134, 67, 138 (list; graph; listen)
OFFSET

1,2

LINKS

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

FORMULA

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

PROGRAM

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

CROSSREFS

Cf. A066069.

Sequence in context: A037905 A154465 A147313 this_sequence A112456 A060534 A060445

Adjacent sequences: A066067 A066068 A066069 this_sequence A066071 A066072 A066073

KEYWORD

easy,nonn,new

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.003 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research