Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136392 a(n) = n*(3n-2) + (n-1)*(3n-5), n>1. +0
2
1, 9, 29, 61, 105, 161, 229, 309, 401, 505, 621, 749, 889, 1041 (list; graph; listen)
OFFSET

1,2

COMMENT

A016777 = (3n+1) with offset 0, but (3n-2) with offset 1, = 1, 4, 7, 10, 13,...

FORMULA

a(n) = n*(3n-2) + (n-1)*(3n-5), n>1 a(n) = n*A016777(n-1) + (n-1)*A016777(n-2). Binomial transform of [1, 8, 12, 0, 0, 0,...].

EXAMPLE

a(5) = 105 = n*(3n-2) + (n-1)*(3n-5) = 5*13 + 4*10 = 65 + 40.

CROSSREFS

Cf. A016777.

Adjacent sequences: A136389 A136390 A136391 this_sequence A136393 A136394 A136395

Sequence in context: A031296 A146869 A129397 this_sequence A055195 A024922 A045862

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 28 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research