A243757 -id:A243757 - cp's OEIS frontend

A254609 Triangle read by rows: T(n,k) = A243757(n)/(A243757(k)*A243757(n-k)).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 5, 1, 1, 1, 5, 5, 5, 1, 1, 1, 1, 1, 5, 5, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 5, 1, 5, 5, 5, 5, 1, 1, 1, 5, 5, 5, 1, 1, 5, 5, 5, 1, 1, 1, 1, 1, 5, 5, 1, 1, 1, 5, 5

Offset: 0

Tom Edgar, Feb 02 2015

These are the generalized binomial coefficients associated with A060904.
The exponent of T(n,k) is the number of 'carries' that occur when adding k and n-k in base 5 using the traditional addition algorithm.
If T(n,k) != 0 mod 5, then n dominates k in base 5.
A194459(n) = number of ones in row n. - Reinhard Zumkeller, Feb 04 2015

			The first five terms in A060904 are 1, 1, 1, 1, and 5 and so T(4,2) = 1*1*1*1/((1*1)*(1*1))=1 and T(5,3) = 5*1*1*1*1/((1*1*1)*(1*1))=5.
The triangle begins:
1
1, 1
1, 1, 1
1, 1, 1, 1
1, 1, 1, 1, 1
1, 5, 5, 5, 5, 1
1, 1, 5, 5, 5, 1, 1
1, 1, 1, 5, 5, 1, 1, 1
1, 1, 1, 1, 5, 1, 1, 1, 1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1
1, 5, 5, 5, 5, 1, 5, 5, 5, 5, 1
1, 1, 5, 5, 5, 1, 1, 5, 5, 5, 1, 1
1, 1, 1, 5, 5, 1, 1, 1, 5, 5, 1, 1, 1
1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Reinhard Zumkeller, Rows n = 0..124 of triangle, flattened
Tyler Ball, Tom Edgar, and Daniel Juda, Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem, Mathematics Magazine, Vol. 87, No. 2, April 2014, pp. 135-143.
Tyler Ball and Daniel Juda, Dominance over N, Rose-Hulman Undergraduate Mathematics Journal, Vol. 13, No. 2, Fall 2013.
Tom Edgar and Michael Z. Spivey, Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6.

Cf. A060904, A243757, A234957, A242849, A082907.

Cf. A194459.

import Data.List (inits)
a254609 n k = a254609_tabl !! n !! k
a254609_row n = a254609_tabl !! n
a254609_tabl = zipWith (map . div)
   a243757_list $ zipWith (zipWith (*)) xss $ map reverse xss
   where xss = tail $ inits a243757_list
-- Reinhard Zumkeller, Feb 04 2015

T(n,k) = A243757(n)/(A243757(k)*A243757(n-k)).
T(n,k) = Product_{i=1..n} A060904(i)/(Product_{i=1..k} A060904(i)*Product_{i=1..n-k} A060904(i)).
T(n,k) = A060904(n)/n*(k/A060904(k)*T(n-1,k-1)+(n-k)/A060904(n-k)*T(n-1,k)).

A136692 Final nonzero digit of n! in base 5.

Original entry on oeis.org

1, 1, 2, 1, 4, 4, 4, 3, 4, 1, 2, 2, 4, 2, 3, 4, 4, 3, 4, 1, 4, 4, 3, 4, 1, 1, 1, 2, 1, 4, 4, 4, 3, 4, 1, 2, 2, 4, 2, 3, 4, 4, 3, 4, 1, 4, 4, 3, 4, 1, 2, 2, 4, 2, 3, 3, 3, 1, 3, 2, 4, 4, 3, 4, 1, 3, 3, 1, 3, 2, 3, 3, 1, 3, 2, 1, 1, 2, 1, 4, 4, 4, 3, 4, 1, 2, 2, 4, 2, 3, 4, 4, 3, 4, 1, 4, 4, 3, 4, 1

Offset: 0

Carl R. White, Jan 16 2008

			6! = 720 decimal = 10340 quinary, so a(6) = 4.

Robert Israel, Table of n, a(n) for n = 0..10000

Cf. A000142, A136690, A136691, A136693, A136694, A136695, A136696, A008904, A136697, A136698, A136699, A136700, A136701, A136702.

Cf. A243757.

f:= proc(n) option remember;
   local t;
   t:= n / 5^padic:-ordp(n,5);
   procname(n-1)*t mod 5
end proc:
f(0):= 1:
map(f, [$0..100]); # Robert Israel, Jun 27 2025

Table[Module[{sp=Split[IntegerDigits[n!,5]]},If[sp[[-1,-1]]==0,sp[[-2, -1]], sp[[-1,-1]]]],{n,0,100}] (* Harvey P. Dale, Oct 26 2016 *)

a(n)={my(v=[1, 1, 2, 1, 4, 4, 4, 3, 4, 1]); if(n==0, 1, lift(prod(k=0, logint(n,5), Mod(v[1 + n\5^k % 10], 5))))} \\ Andrew Howroyd, Sep 27 2024

a(n) = (n!/A243757(n)) mod 5. - Ridouane Oudra, Sep 27 2024

A243758 a(n) = Product_{i=1..n} A234959(i).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 6, 6, 6, 6, 6, 6, 36, 36, 36, 36, 36, 36, 216, 216, 216, 216, 216, 216, 1296, 1296, 1296, 1296, 1296, 1296, 7776, 7776, 7776, 7776, 7776, 7776, 279936, 279936, 279936, 279936, 279936, 279936, 1679616, 1679616, 1679616, 1679616, 1679616, 1679616, 10077696

Offset: 0

Tom Edgar, Jun 10 2014

This is the generalized factorial for A234959.

a(0) = 1 as it represents the empty product.

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Tyler Ball, Tom Edgar, and Daniel Juda, Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem, Mathematics Magazine, Vol. 87, No. 2, April 2014, pp. 135-143.

Cf. A060828, A060818, A234959, A242954, A243757.

a243758 n = a243758_list !! n
a243758_list = scanl (*) 1 a234959_list
-- Reinhard Zumkeller, Feb 09 2015

Table[Product[6^IntegerExponent[k, 6], {k, 1, n}], {n, 0, 20}] (* G. C. Greubel, Dec 24 2016 *)

valp(n,p)=my(s); while(n\=p, s+=n); s
a(n)=6^valp(n,6) \\ Charles R Greathouse IV, Oct 03 2016

S=[0]+[6^valuation(i,6) for i in [1..100]]
[prod(S[1:i+1]) for i in [0..99]]

a(n) = Product_{i=1..n} A234959(i).

a(n) = 6^(A054895(n)).

cp's OEIS Frontend

A254609 Triangle read by rows: T(n,k) = A243757(n)/(A243757(k)*A243757(n-k)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Formula

A136692 Final nonzero digit of n! in base 5.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A243758 a(n) = Product_{i=1..n} A234959(i).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Sage

Formula