Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156885
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156885 Higher (A097886) Pisot base q-factorials as anti-diagonals: t(n,m)=If[m == 0, n!, Product[Sum[((m + 1)^2 - (m + 1)^3 - (m + 1)^4 + (m + 1)^5)^i, {i, 0, k - 1}], {k, 1, n}]]. +0
1
1, 1, 1, 1, 1, 2, 1, 1, 13, 6, 1, 1, 145, 2041, 24, 1, 1, 721, 3027745, 3847285, 120, 1, 1, 2401, 374286241, 9104020469425, 87029433985, 720, 1, 1, 6301, 13835524801, 139895890728482161, 3941936722370875247425, 23624400943530205, 5040, 1, 1 (list; table; graph; listen)
OFFSET

0,6

COMMENT

Row sums are:

{1, 2, 4, 21, 2212, 6875873, 9191424192774, 3942100242676382795935,

245818793081825620005707057455928,

2214028573870705926858147503913066883765268001,

3870740693324968443335547157095204009451827919255850259270826,...}.

This result comes from truncated versions of:

1/(1-(x^2 - x^3 - x^4 + x^5))=Sum[(x^2 - x^3 - x^4 + x^5)^k, {k, 0, Infinity}].

as polynomials.

The q-combinations that result come up as higher odd q-combinations of the Gaussian type.

There exists the possibility that the q-combinations being Gaussian

is connected to the minimal Pisot condition?

If that conjecture is true, then this is the next (x^5 level) minimal Pisot

as has been conjectured but not proved.

REFERENCES

A. K. Kwasniewski, This is the definition which is the right answer to the leitmotiv questions, arXiv:0902.2827v1 [v1] Tue, 17 Feb 2009 04:02:30 GMT; http://ii.uwb.edu.pl/akk/sem/subjects/sub2.htm

FORMULA

t(n,m)=If[m == 0, n!, Product[Sum[((m + 1)^2 - (m + 1)^3 - (m + 1)^4 + (m + 1)^5)^i, {i, 0, k - 1}], {k, 1, n}]];

out_(n,m)=anti=diagonal(t(n,m)).

EXAMPLE

{1},

{1, 1},

{1, 1, 2},

{1, 1, 13, 6},

{1, 1, 145, 2041, 24},

{1, 1, 721, 3027745, 3847285, 120},

{1, 1, 2401, 374286241, 9104020469425, 87029433985, 720},

{1, 1, 6301, 13835524801, 139895890728482161, 3941936722370875247425, 23624400943530205, 5040},

{1, 1, 14113, 250126392601, 191342020690972807201, 37647708708606962302844988481, 245781145295970673286172912828625, 76954997736290200384585, 40320},

{1, 1, 28225, 2810782578241, 62553283183270980468901, 6350915240360302787961039411849601, 7294653000969702909080870533481434048093201, 2206733920863382300595883289015404396404598625, 3008112760488293033932137288325, 362880},

{1, 1, 51841, 22484667268225, 7899938899219402281285985, 98555586784736445916052229133062235201, 505910297105714537321425880957644065329143376652001, 1017661213536789800742601095945724759083540880488018115204321, 2853079479282268345485721949958072273831877729399692956880625, 1411018283196351232910292567975796063825, 3628800}

MATHEMATICA

Clear[t, n, m, i, k, a, b];

t[n_, m_] = If[m == 0, n!, Product[Sum[((m + 1)^2 - (m + 1)^3 - (m + 1)^4 + (m + 1)^5)^i, {i, 0, k - 1}], {k, 1, n}]];

a = Table[Table[t[n, m], {n, 0, 10}], {m, 0, 10}];

b = Table[Table[a[[m, n - m + 1]], {m, n, 1, -1}], {n, 1, Length[a]}];

Flatten[%]

CROSSREFS

Sequence in context: A158202 A066094 A010246 this_sequence A054505 A132610 A132625

Adjacent sequences: A156882 A156883 A156884 this_sequence A156886 A156887 A156888

KEYWORD

nonn,tabl,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 17 2009

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research