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.

A277603 Exceptional Bobo numbers: terms of A242679 that satisfy frac[e*A242679(n)]<(e-1)/2.

Original entry on oeis.org

36, 9045, 5195512, 5311399545, 8488859795196, 25466579385587, 19542965851120621, 58628897553361862, 61250772004870841520, 183752316014612524559, 250769086731739376780337, 752307260195218130341010, 1299515735021702625544976020, 3898547205065107876634928059
Offset: 1

Views

Author

Steven J. Kifowit, Oct 22 2016

Keywords

Comments

The exceptional Bobo numbers (EBNs) are very rare relative to the Bobo numbers (A242679).
Exceptional Bobo numbers come in two varieties. Type-1 EBNs are given by the recurrence E(0)=1,E(1)=1,E(k)=(2*k-1)*(2*E(k-1)-1)+E(k-2) for k=3,5,7,... These are derived from the denominators of the odd-indexed convergents of the continued fraction expansion of (e-1)/2 = [0;1,6,10,14,18,...]. The Type-2 EBNs are derived from the Type-1 EBNs. They have the form n*m-(m-1)/2 where n is a Type-1 EBN and m>=3 is an odd integer. However, not every number of this form is an EBN.

References

  • S. J. Kifowit, A. Mitchell, and S. Zandi, Exceptional Bobo Numbers, in preparation 2016

Crossrefs

Cf. A103762, A242679 (Bobo numbers).

A103762 a(n) = least k with Sum_{j = n..k} 1/j >= 1.

Original entry on oeis.org

1, 4, 7, 10, 12, 15, 18, 20, 23, 26, 29, 31, 34, 37, 39, 42, 45, 48, 50, 53, 56, 58, 61, 64, 67, 69, 72, 75, 77, 80, 83, 86, 88, 91, 94, 97, 99, 102, 105, 107, 110, 113, 116, 118, 121, 124, 126, 129, 132, 135, 137, 140, 143, 145, 148, 151, 154, 156, 159, 162
Offset: 1

Views

Author

David W. Wilson, Apr 14 2008

Keywords

Comments

a(n) = A136617(n) + n for n > 1. Also a(n) = A136616(n-1) + 1 for n > 1.
If you compare this to floor(e*n) = A022843, 2,5,8,10,13,16,..., it appears that floor(e*n)-a(n) = 1,1,1,0,1,1,1,1,1,1,0,..., initially consisting of 0's and 1's. The places where the 0's occur are 4, 11, 18, 25, 32, 36, 43, 50, 57, 64, 71, ... whose differences seem to be 4, 7 or 11.
There are some rather sharp estimates on this type of differences between harmonic numbers in Theorem 3.2 of the Sintamarian reference, which may help to uncover such a pattern. - R. J. Mathar, Apr 15 2008
a(n) = round(e*(n-1/2)) with the exception of the terms of A277603; at those values of n, a(n) = round(e*(n-1/2)) + 1. - Jon E. Schoenfield, Apr 03 2018

Crossrefs

Cf. A136616, A136617, A242679 (Bobo numbers).

Programs

  • Mathematica
    i = 0; s = 0; Table[While[s < 1, i++; s = s + 1/i]; s = s - 1/n; i, {n, 100}] (* T. D. Noe, Jun 26 2012 *)
  • PARI
    default(realprecision, 10^5); e=exp(1);
    a(n) = if(n<2, 1, floor(e*n+(1-e)/2+(e-1/e)/(24*n-12))); \\ Jinyuan Wang, Mar 06 2020
Showing 1-2 of 2 results.