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

A195697 First denominator and then numerator in a fraction expansion of log(2) - Pi/8.

Original entry on oeis.org

2, 1, 3, -1, 12, 1, 30, 1, 35, -1, 56, 1, 90, 1, 99, -1, 132, 1, 182, 1, 195, -1, 240, 1, 306, 1, 323, -1, 380, 1, 462, 1, 483, -1, 552, 1, 650, 1, 675, -1, 756, 1, 870, 1, 899, -1, 992, 1, 1122, 1, 1155, -1, 1260
Offset: 1

Views

Author

Mohammad K. Azarian, Sep 25 2011

Keywords

Comments

The minus sign in front of a fraction is considered the sign of the numerator.

Examples

			1/2 - 1/3 + 1/12 + 1/30 - 1/35 + 1/56 + 1/90 - 1/99 + 1/132 + 1/182 - 1/195 + 1/240 + ... = [(1 - 1/2) + (1/3 - 1/4) + (1/5 - 1/6) + (1/7 - 1/8) + (1/9 - 1/10) + (1/11 - 1/12) + ... ] - (1/2)*[(1 - 1/3) + (1/5 - 1/7) + (1/9 - 1/11) + (1/13 - 1/15) + ... ] = log(2) - Pi/8.
		

References

  • Mohammad K. Azarian, Problem 1218, Pi Mu Epsilon Journal, Vol. 13, No. 2, Spring 2010, p. 116. Solution published in Vol. 13, No. 3, Fall 2010, pp. 183-185.
  • Granino A. Korn and Theresa M. Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Company, New York (1968).

Crossrefs

Formula

log(2) - Pi/8 = Sum_{n>=1} (-1)^(n+1)*(1/n) + (-1/2)*Sum_{n>=0} (-1)^n*(1/(2*n+1)).
Empirical g.f.: x*(2+x+x^2-2*x^3+9*x^4+2*x^5+14*x^6-2*x^7+3*x^8+2*x^9+3*x^10-2*x^11+x^13) / ((1-x)^3*(1+x)^3*(1-x+x^2)^2*(1+x+x^2)^2). - Colin Barker, Dec 17 2015

A245853 Powers of 12 without the digit '0' in their decimal expansion.

Original entry on oeis.org

1, 12, 144, 1728, 248832, 2985984, 429981696, 61917364224, 1283918464548864, 3833759992447475122176, 11447545997288281555215581184
Offset: 1

Views

Author

Vincenzo Librandi, Aug 04 2014

Keywords

Comments

Conjectured to be finite.

Crossrefs

Cf. Powers of k without the digit '0' in their decimal expansion: A238938 (k=2), A238939 (k=3), A238940 (k=4), A195948 (k=5), A238936 (k=6), A195908 (k=7), A245852 (k=8), A240945 (k=9), A195946 (k=11), this sequence (k=12), A195945 (k=13).

Programs

  • Magma
    [12^n: n in [0..3*10^4] | not 0 in Intseq(12^n)];
  • Mathematica
    Select[12^Range[0, 2*10^5], DigitCount[#, 10, 0]==0 &]

A195985 Least prime such that p^2 is a zeroless n-digit number.

Original entry on oeis.org

2, 5, 11, 37, 107, 337, 1061, 3343, 10559, 33343, 105517, 333337, 1054133, 3333373, 10540931, 33333359, 105409309, 333333361, 1054092869, 3333333413, 10540925639, 33333333343, 105409255363, 333333333367, 1054092553583, 3333333333383, 10540925534207
Offset: 1

Views

Author

M. F. Hasler, Sep 26 2011

Keywords

Examples

			a(1)^2=4, a(2)^2=25, a(3)^2=121, a(4)^2=1369 are the least squares of primes with 1, 2, 3 resp. 4 digits, and these digits are all nonzero.
a(5)=107 since 101^2=10201 and 103^2=10609 both contain a zero digit, but 107^2=11449 does not.
a(1000)=[10^500/3]+10210 (500 digits), since primes below sqrt(10^999) = 10^499*sqrt(10) ~ 3.162e499 have squares of less than 1000 digits, between sqrt(10^999) and 10^500/3 = sqrt(10^1000/9) ~ 3.333...e499 they have at least one zero digit. Finally, the 7 primes between 10^500/3 and a(1000) also happen to have a "0" digit in their square, but not so
  a(1000)^2 = 11111...11111791755555...55555659792849
  = [10^500/9]*(10^500+5) + 6806*10^500+104237294.
		

Crossrefs

Programs

  • PARI
    a(n)={ my(p=sqrtint(10^n\9)-1); until( is_A052382(p^2), p=nextprime(p+2));p}

A252482 Exponents n such that the decimal expansion of the power 12^n contains no zeros.

Original entry on oeis.org

0, 1, 2, 3, 5, 6, 8, 10, 14, 20, 26
Offset: 1

Views

Author

M. F. Hasler, Dec 17 2014

Keywords

Comments

Conjectured to be finite.
See A245853 for the actual powers 12^a(n).

Crossrefs

For zeroless powers x^n, see A238938 (x=2), A238939, A238940, A195948, A238936, A195908, A245852, A240945 (k=9), A195946 (x=11), A245853, A195945; A195942, A195943, A103662.
For the corresponding exponents, see A007377, A030700, A030701, A008839, A030702, A030703, A030704, A030705, A030706, this sequence A252482, A195944.
For other related sequences, see A052382, A027870, A102483, A103663.

Programs

  • Mathematica
    Select[Range[0,30],DigitCount[12^#,10,0]==0&] (* Harvey P. Dale, Apr 06 2019 *)
  • PARI
    for(n=0,9e9,vecmin(digits(12^n))&&print1(n","))

A306117 Largest k such that 7^k has exactly n digits 0 (in base 10), conjectured.

Original entry on oeis.org

35, 51, 93, 58, 122, 74, 108, 131, 118, 152, 195, 192, 236, 184, 247, 243, 254, 286, 325, 292, 318, 336, 375, 393, 339, 431, 327, 433, 485, 447, 456, 455, 448, 492, 452, 507, 489, 541, 526, 605, 627, 706, 730, 628, 665, 660, 798, 715, 704, 633, 728
Offset: 0

Views

Author

M. F. Hasler, Jun 22 2018

Keywords

Comments

a(0) is the largest term in A030703: exponents of powers of 7 without digit 0 in base 10.
There is no proof for any of the terms, just as for any term of A020665 and many similar / related sequences. However, the search has been pushed to many magnitudes beyond the largest known term, and the probability of any of the terms being wrong is extremely small, cf., e.g., the Khovanova link.

Crossrefs

Cf. A063606: least k such that 7^k has n digits 0 in base 10.
Cf. A305947: number of k's such that 7^k has n digits 0.
Cf. A305927: row n lists exponents of 6^k with n digits 0.
Cf. A030703: { k | 7^k has no digit 0 } : row 0 of the above.
Cf. A195908: { 7^k having no digit 0 }.
Cf. A020665: largest k such that n^k has no digit 0 in base 10.
Cf. A071531: least k such that n^k contains a digit 0 in base 10.
Cf. A103663: least x such that x^n has no digit 0 in base 10.
Cf. A306112, ..., A306119: analog for 2^k, ..., 9^k.

Programs

  • PARI
    A306117_vec(nMax,M=99*nMax+199,x=7,a=vector(nMax+=2))={for(k=0,M,a[min(1+#select(d->!d,digits(x^k)),nMax)]=k);a[^-1]}
Previous Showing 21-25 of 25 results.