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.

User: Brian Labore

Brian Labore's wiki page.

Brian Labore has authored 1 sequences.

A343191 Squiggle Dot Numbers: numbers generated in a similar way to those in A010790 except that every prime number is divided instead of multiplied. The result is then rounded to the closest integer.

Original entry on oeis.org

1, 1, 0, 0, 0, 0, 0, 0, 8, 677, 616, 671, 620, 668, 140180, 33643245, 31664230, 33526832, 31762262, 33433960, 14042263246, 6487525619781, 6205459288487, 6475261866247, 3885157119748074, 2525352127836247843, 1772797193741045985945, 1340234678468230765374557, 1294019689555533152775435
Offset: 1

Author

Brian Labore, Apr 07 2021

Keywords

Examples

			              / 1*4*6*8*9*10*9*8*6*4*1 \
a(10) = round | ---------------------- |             = 677;
              \    2*3*5*7 * 7*5*3*2   /
              / 1*4*6*8*9*10*10*9*8*6*4*1 \
a(11) = round | ------------------------- |          = 616;
              \     2*3*5*7*11*7*5*3*2    /
              / 1*4*6*8*9*10*12*10*9*8*6*4*1 \
a(12) = round | ----------------------------- |      = 671;
              \    2*3*5*7*11*11*7*5*3*2     /
              / 1*4*6*8*9*10*12*12*10*9*8*6*4*1 \
a(13) = round | ------------------------------- |    = 620.
              \    2*3*5*7*11*13*11*7*5*3*2     /
		

Crossrefs

Cf. A010790.

Programs

  • PARI
    sqdot(n)={my(s=if(isprime(n),1/n,n));for(k=2,n-1,my(kk=k*k);if(isprime(k),s/=kk,s*=kk));round(s)};
    for(k=1,29,print1(sqdot(k),", ")) \\ Hugo Pfoertner, Apr 07 2021

Formula

a(n) = round(n^(2*A010051(n)-1)*(A000142(n)/A034386(n)^2)^2).