Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081666 n3^(n-1)+A081567(n). +0
1
1, 4, 16, 62, 233, 855, 3083, 10978, 38746, 135924, 474955, 1655789, 5766389, 20080608, 69976772, 244166410, 853410637, 2988825507, 10490538559, 36905911166, 130139760590, 459970519296, 1629395348591, 5784362027257 (list; graph; listen)
OFFSET

0,2

COMMENT

Second binomial transform of n+F(n+1)

FORMULA

a(n)=A027471(n-1)+A081567(n) G.f.: (1-7x+16x^2-13x^3)/((3x - 1)^2(5x^2-5x+1))

CROSSREFS

Cf. A000045.

Sequence in context: A133161 A103820 A084859 this_sequence A085781 A113438 A034542

Adjacent sequences: A081663 A081664 A081665 this_sequence A081667 A081668 A081669

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 26 2003

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 September 5 23:56 EDT 2008. Contains 143485 sequences.


AT&T Labs Research