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-2 of 2 results.

A195057 Decimal expansion of Pi^2/11.

Original entry on oeis.org

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

Views

Author

Omar E. Pol, Oct 04 2011

Keywords

Examples

			0.8972367637353962380758628181705591941194...
		

Crossrefs

Programs

  • Magma
    Pi(RealField(129))^2/11; // G. C. Greubel, Jun 03 2021
    
  • Mathematica
    RealDigits[Pi^2/11, 10, 105][[1]] (* T. D. Noe, Oct 05 2011 *)
  • Sage
    numerical_approx(pi^2/11, digits=128) # G. C. Greubel, Jun 03 2021

Extensions

Extended by T. D. Noe, Oct 05 2011

A316499 Intersection of A001694 and A195069.

Original entry on oeis.org

2048, 9216, 13824, 20736, 25600, 31104, 46656, 50176, 64000, 69984, 104976, 115200, 123904, 157464, 160000, 172800, 173056, 175616, 177147, 225792, 236196, 259200, 288000, 338688, 388800, 400000, 432000, 508032, 557568, 583200, 614656, 627200, 648000, 681472, 720000, 762048, 778752, 790272
Offset: 1

Views

Author

Robert Israel, Jul 04 2018

Keywords

Comments

Powerful(1) numbers k such that A046660(k) = 10.
These are the "primitive" members of A195069, in the sense that A195059 is the set of numbers k*m where k is in this sequence and m is squarefree and coprime to k.

Examples

			a(3)=13824 is a member because 13824= 2^9*3^3, 9 and 3 are both greater than 1 and (9-1)+(3-1)=10.
		

Crossrefs

Programs

  • Maple
    N:= 10^6: # to get all terms <= N
    p:= 1:
    for i from 1 to 10 do F[i]:= {} od:
    do
      p:= nextprime(p);
      if p^2 > N then break fi;
      for i from min(10,floor(log[p](N))-1) to 2 by -1 do F[i]:= F[i] union
        select(`<=`,`union`({p^(i+1)},seq(map(t -> p^(i+1-j)*t, F[j]),j=1..i-1)),N)
      od;
      F[1]:= F[1] union {p^2};
    od:
    sort(convert(F[10],list));
Showing 1-2 of 2 results.