cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A249442 a(n) is the smallest m such that binomial(n,m) is not squarefree, or a(n)=0, if there is no such m.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 3, 0, 1, 1, 2, 0, 1, 5, 3, 7, 1, 2, 1, 2, 1, 4, 3, 0, 1, 1, 2, 1, 1, 3, 3, 5, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 8, 1, 1, 2, 21, 1, 1, 1, 2, 1, 4, 1, 2, 1, 2, 3, 6, 1, 6, 3, 1, 1, 2, 3, 4, 1, 6, 3, 8, 1, 2, 3, 1, 1, 3, 3, 8, 1, 1, 2, 3, 1, 5, 3
Offset: 0

Views

Author

Keywords

Comments

The sequence gives the position of the first zero on row n (both starting from zero) in the triangular table A103447, and zero if there is no zero on that row. After a(0) = 0, A048278 gives the positions of seven other zeros in the sequence.
Records are 0,1,3,5,7,8,21,... (A249439) in positions 0,4,6,13,15,43,47,... (A249440).

Crossrefs

A249439 gives the record values, A249440 the positions where they occur for the first time.
Differs from A249695 for the first time at n=9.

Programs

  • Mathematica
    Table[If[#>n,0,#]&[NestWhile[#+1&,1,SquareFreeQ[Binomial[n,#]]&]],{n,0,100}] (* Peter J. C. Moses, Nov 04 2014 *)
  • PARI
    A249442(n) = { for(k=0,n\2,if(0==moebius(binomial(n,k)),return(k))); return(0); }
    for(n=0, 10000, write("b249442.txt", n, " ", A249442(n)));
    \\ Antti Karttunen, Nov 04 2014

Formula

Other identities:
A249716(n) = binomial(n, a(n)). [A249716(n) gives the corresponding minimal nonsquarefree binomial coefficient, or 1 when n is one of the terms of A048278].

Extensions

More terms from Peter J. C. Moses, Oct 28 2014

A249440 Positions of records in A249442.

Original entry on oeis.org

0, 4, 6, 13, 15, 43, 47, 239, 7199, 16559, 21599, 33119, 45359, 60479, 90719, 1179359
Offset: 1

Views

Author

Keywords

Comments

a(16) = 1179359 is the largest term less than 7,000,000.
From a(8) = 239 onward the decimal representation of all terms seem to end with '9', which indicates that from then on, one larger numbers (A249149) are multiples of ten.

Crossrefs

A249439 gives the corresponding record values.
One less than A249149.

A249714 Record values in A249695.

Original entry on oeis.org

0, 1, 3, 6, 7, 12, 21, 24, 48, 96, 192, 384, 768, 1536, 3072, 6144, 12288, 24576, 49152, 98304, 196608, 393216, 786432, 1572864, 3145728, 6291456, 12582912, 25165824, 50331648
Offset: 1

Views

Author

Keywords

Comments

For n >= 8 [a(8) = 24], the terms seem to be given by A007283(n-5), i.e. as 3 * 2^(n-5).

Crossrefs

A249715 gives the positions where these values occur in A249695 for the first time.

Programs

  • PARI
    A249695(n) = { for(p=2,3,for(k=0,floor(n/2),if((0==(binomial(n,k)%(p*p))),return(k)))); return(0); } \\ Unoptimized and straightforward.
    A249695(n) = { for(p=2,3, my(o=0); for(k=1, n\2, o+=valuation((n-k+1)/k, p); if(o>1, return(k)))); return(0); } \\ Better to use this. Based on Charles R Greathouse IV's PARI-code for A249441.
    prevmax = -1; i = 0; for(n=0, 123456789, if((k=A249695(n)) > prevmax, prevmax = k; i++; write("b249714.txt", i, " ", k); write("b249715.txt", i, " ", n))); \\ Compute both A249714 & A249715 at the same time.

Formula

a(n) = A249695(A249715(n)).
Showing 1-3 of 3 results.