[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A094496 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) = binomial(n,k) - binomial(n,k) mod n^2, with T(0,0) = 1.
(history; published version)
#11 by OEIS Server at Thu Dec 12 14:54:51 EST 2024
LINKS

Andrew Howroyd, <a href="/A094496/b094496_1.txt">Table of n, a(n) for n = 0..1325</a> (rows 0..50)

#10 by Peter Luschny at Thu Dec 12 14:54:51 EST 2024
STATUS

proposed

approved

Discussion
Thu Dec 12
14:54
OEIS Server: Installed first b-file as b094496.txt.
#9 by Andrew Howroyd at Thu Dec 12 11:36:40 EST 2024
STATUS

editing

proposed

#8 by Andrew Howroyd at Thu Dec 12 11:35:52 EST 2024
DATA

1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 81, 81, 81, 81, 0, 0, 0, 0, 0, 0, 100, 200, 200, 200, 100, 0, 0, 0, 0, 0, 0, 121, 242, 363, 363, 242, 121, 0, 0, 0, 0, 0, 0, 144, 432, 720, 864, 720, 432, 144, 0, 0, 0

EXAMPLE

Triangle begins:

1;

1, 1;

0, 0, 0;

0, 0, 0, 0;

0, 0, 0, 0, 0;

0, 0, 0, 0, 0, 0;

0, 0, 0, 0, 0, 0, 0;

0, 0, 0, 0, 0, 0, 0, 0;

0, 0, 0, 0, 64, 0, 0, 0, 0;

0, 0, 0, 81, 81, 81, 81, 0, 0, 0;

0, 0, 0, 100, 200, 200, 200, 100, 0, 0, 0;

...

#7 by Andrew Howroyd at Thu Dec 12 11:27:41 EST 2024
NAME

a[n]=C[n,j]-Mod[C[n,j],n^2], difference of binomial coefficients and its residue mod n^2 read by rows.

Triangle read by rows: T(n,k) = binomial(n,k) - binomial(n,k) mod n^2, with T(0,0) = 1.

COMMENTS

a[0]=1 by convention.

First deviation from A007318 is at a[40] because C[8,4]=70 and Mod[70,64]=6.

FORMULA

T(n,k) = A007318(n,k) - A094495(n,k).

EXAMPLE

T(8,6) = binomial(8,4) - binomial(8,4) mod 8^2 = 70 - 6 = 64.

Discussion
Thu Dec 12
11:32
Andrew Howroyd: I've added 'less' due to large number of 0's - to lower priority in search results. (not obvious why interesting)
#6 by Andrew Howroyd at Thu Dec 12 11:20:11 EST 2024
COMMENTS

First deviation from A007318 is at a[40] because C[8,4]=70 and Mod[70,64]=6.

LINKS

Andrew Howroyd, <a href="/A094496/b094496_1.txt">Table of n, a(n) for n = 0..1325</a> (rows 0..50)

EXAMPLE

First deviation from A007318 is at a[40] because C[8,4]=70 and Mod[70,64]=6.

PROG

(PARI) T(n, k) = my(x=binomial(n, k)); x - if(n, x % n^2) \\ Andrew Howroyd, Dec 12 2024

KEYWORD

easy,nonn,tabl,less

STATUS

approved

editing

#5 by N. J. A. Sloane at Tue Oct 15 22:32:24 EDT 2013
AUTHOR

_Labos E. (labos(AT)ana.sote.hu), Elemer_, Jun 02 2004

Discussion
Tue Oct 15
22:32
OEIS Server: https://oeis.org/edit/global/2029
#4 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006
EXAMPLE

First deviation from A007318 is at a[40], because C[8,4]=70 and Mod[70,64]=6.

MATHEMATICA

Flatten[Table[Table[Binomial[n, j]-Mod[Binomial[n, j], n^2], {j, 0, n}], {n, 1, 20}], 1]

KEYWORD

easy,nonn,tabl,new

#3 by N. J. A. Sloane at Tue Jan 24 03:00:00 EST 2006
KEYWORD

easy,nonn,tabl,new

AUTHOR

Labos E. (labos(AT)ana1ana.sote.hu), Jun 02 2004

#2 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004
DATA

1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 81, 81, 81, 81, 0, 0, 0, 0, 0, 0, 100, 200, 200, 200, 100, 0, 0, 0, 0, 0, 0, 121, 242, 363, 363, 242, 121, 0, 0, 0, 0, 0, 0, 144, 432, 720, 864, 720, 432

OFFSET

1,40

0,41

COMMENTS

a[0]=1 by convention.

KEYWORD

easy,nonn,tabl,new