login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016939 a(n) = (6n+2)^7. 1
128, 2097152, 105413504, 1280000000, 8031810176, 34359738368, 114415582592, 319277809664, 781250000000, 1727094849536, 3521614606208, 6722988818432, 12151280273024, 20971520000000, 34792782221696 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..2000

Index entries for linear recurrences with constant coefficients, signature (8, -28, 56, -70, 56, -28, 8, -1).

FORMULA

a(n)=128*A016783(n). - R. J. Mathar, May 07 2008

G.f.: 128*(1 + 16376*x + 692499*x^2 + 3870352*x^3 + 4890287*x^4 + 1475736*x^5 + 77101*x^6 + 128*x^7)/(1 - x)^8. - Ilya Gutkovskiy, Jun 16 2016

MATHEMATICA

Table[(6n+2)^7, {n, 0, 100}] (* Mohammad K. Azarian, Jun 15 2016 *)

PROG

(MAGMA) [(6*n+2)^7: n in [0..30]]; // Vincenzo Librandi, May 04 2011

CROSSREFS

Sequence in context: A227605 A016879 A227661 * A017011 A196995 A214389

Adjacent sequences:  A016936 A016937 A016938 * A016940 A016941 A016942

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 00:10 EDT 2019. Contains 327990 sequences. (Running on oeis4.)