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.

Previous Showing 21-24 of 24 results.

A377041 First term of the n-th differences of the squarefree numbers. Inverse zero-based binomial transform of A005117.

Original entry on oeis.org

1, 1, 0, 1, -3, 6, -8, 3, 22, -92, 252, -578, 1189, -2255, 3991, -6617, 10245, -14626, 18666, -19635, 12104, 13090, -69122, 171478, -332718, 552138, -798629, 982514, -901485, 116219, 2351842, -8715135, 23856206, -57926011, 130281064, -273804584, 535390333
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Crossrefs

The version for primes is A007442, noncomposites A030016, composites A377036.
This is the first column of A377038.
For nonsquarefree numbers we have A377049.
For prime-powers we have A377054.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
A377042 gives first position of 0 in each row of A377038.
Cf. A053797, A053806, A061398, A072284, A076259, A120992, A376311, A376590, A376591, A377040, A377046.

Programs

  • Mathematica
    q=Select[Range[100],SquareFreeQ];
t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[1+k]],{k,0,j}],{j,0,Length[q]/2}]

Formula

The inverse zero-based binomial transform of a sequence (q(0), q(1), q(2), ...) is the sequence p given by:
p(j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) q(k)

A379306 Number of squarefree prime indices of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 1, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 2, 3, 2, 1, 3, 1, 5, 2, 2, 1, 4, 0, 1, 2, 4, 1, 2, 1, 3, 3, 1, 1, 5, 0, 3, 2, 3, 0, 4, 2, 3, 1, 2, 1, 4, 0, 2, 2, 6, 2, 3, 1, 3, 1, 2, 0, 5, 1, 1, 3, 2, 1, 3, 1, 5, 4, 2, 1, 3, 2, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Dec 25 2024

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			The prime indices of 39 are {2,6}, so a(39) = 2.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Crossrefs

Positions of first appearances are A000079.
Positions of zero are A379307, counted by A114374 (strict A256012).
Positions of one are A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A057627, A068361, A070321, A071403, A072284, A112925, A112929, A120327, A377430, A378086.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],SquareFreeQ]],{n,100}]

Formula

Totally additive with a(prime(k)) = A008966(k).

A377036 First term of the n-th differences of the composite numbers. Inverse zero-based binomial transform of A002808.

Original entry on oeis.org

4, 2, 0, -1, 2, -2, 0, 4, -8, 8, 0, -16, 32, -32, -1, 78, -233, 687, -2363, 8160, -25670, 72352, -184451, 430937, -933087, 1888690, -3597221, 6479696, -11086920, 18096128, -28307626, 42644791, -62031001, 86466285, -110902034, 110907489, -52325, -483682930
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Crossrefs

The version for prime instead of composite is A007442.
For noncomposite numbers we have A030016.
This is the first column (n=1) of A377033.
For row-sums we have A377034, absolute version A377035.
First zero positions are A377037, cf. A376678, A376855, A377042, A377050, A377055.
For squarefree instead of composite we have A377041, nonsquarefree A377049.
For prime-power instead of composite we have A377054.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, seconds A036263.
A002808 lists the composite numbers, differences A073783, seconds A073445.
A008578 lists the noncomposites, differences A075526.
Cf: A018252, A065310, A065890, A140119, A173390, A333214, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680.

Programs

  • Mathematica
    q=Select[Range[100],CompositeQ];
t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[1+k]],{k,0,j}],{j,0,Length[q]-1}]

Formula

The inverse zero-based binomial transform of a sequence (q(0), q(1), ..., q(m)) is the sequence p given by:
p(j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) q(k)

A379542 Second term of the n-th differences of the prime numbers.

Original entry on oeis.org

3, 2, 0, 2, -6, 14, -30, 62, -122, 220, -344, 412, -176, -944, 4112, -11414, 26254, -53724, 100710, -175034, 281660, -410896, 506846, -391550, -401486, 2962260, -9621128, 24977308, -57407998, 120867310, -236098336, 428880422, -719991244, 1096219280
Offset: 0

Views

Author

Gus Wiseman, Jan 12 2025

Keywords

Comments

Also the inverse zero-based binomial transform of the odd prime numbers.

Crossrefs

For all primes (not just odd) we have A007442.
Including 1 in the primes gives A030016.
Column n=2 of A095195.
The version for partitions is A320590 (first column A281425), see A175804, A053445.
For nonprime instead of prime we have A377036, see A377034-A377037.
Arrays of differences: A095195, A376682, A377033, A377038, A377046, A377051.
A000040 lists the primes, differences A001223, A036263.
A002808 lists the composite numbers, differences A073783, A073445.
A008578 lists the noncomposite numbers, differences A075526.
Cf. A064113, A065890, A084758, A140119, A173390, A258025, A258026, A293467, A333214, A333254, A377041.

Programs

  • Mathematica
    nn=40;Table[Differences[Prime[Range[nn+2]],n][[2]],{n,0,nn}]
  • PARI
    a(n) = sum(k=0, n, (-1)^(n-k) * binomial(n,k) * prime(k+2)); \\ Michel Marcus, Jan 12 2025

Formula

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * prime(k+2).
Previous Showing 21-24 of 24 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.