login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015005 q-factorial numbers for q=6. 2
1, 7, 301, 77959, 121226245, 1131162092095, 63330372050122765, 21274128570193389587095, 42878835824239014254983869205, 518543838148941095553869851505328175, 37625235473766496167083515195884075739704925 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..50

Index entries for sequences related to factorial numbers

FORMULA

a(n) = product_{k=1..n} (6^k-1)/(6-1).

a(1) = 1, a(n) = (6^n-1)*a(n-1)/5. - Vincenzo Librandi, Oct 25 2012

MATHEMATICA

RecurrenceTable[{a[1]==1, a[n]==((6^n - 1) * a[n-1])/5}, a, {n, 15}] (* Vincenzo Librandi, Oct 25 2012 *)

Table[QFactorial[n, 6], {n, 15}] (* Bruno Berselli, Aug 14 2013 *)

PROG

(MAGMA) [n le 1 select 1 else (6^n-1)*Self(n-1)/5: n in [1..15]]; // Vincenzo Librandi, Oct 25 2012

CROSSREFS

Sequence in context: A082168 A096348 A281435 * A209806 A257919 A002437

Adjacent sequences:  A015002 A015003 A015004 * A015006 A015007 A015008

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

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 January 23 22:36 EST 2020. Contains 331177 sequences. (Running on oeis4.)