This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144912 Unreduced numerators of digital mean, dm_num(b, n), with rows n in {2, 3, 4, ...} and columns b in {2, 3, 4, ..., n}. 15
 0, 2, -2, -1, 0, -4, 1, 2, -2, -6, 1, 0, 0, -4, -8, 3, 2, 2, -2, -6, -10, -2, 4, -2, 0, -4, -8, -12, 0, -4, 0, 2, -2, -6, -10, -14, 0, -2, 2, -4, 0, -4, -8, -12, -16, 2, 0, 4, -2, 2, -2, -6, -10, -14, -18, 0, -2, 0, 0, -6, 0, -4, -8, -12, -16, -20 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS The unreduced numerator of dm(b, n) is Sum(i in [1, d]: d_i * 2 - (b - 1)), where d is the number of digits in the base b representation of n and d_i the individual digits. The corresponding denominator is 2 * d, giving a value in (-(b - 1) / 2, (b - 1) / 2] for n > 0. dm_num(b, n) = d(b - 1) iff all the digits in n are b - 1. dm_num(b, n) = -2(b - 2) for b = n, because n in base n is 10, giving dm_num(n, n) = 2 - n + 1 + 0 - n + 1 = 4 - 2 * n = -2(n - 2). dm_num(b, n) = 0 for odd b and n having all digits equal to (b - 1) / 2, as well as for many other (b, n). Defining m = ceiling((n + 1) / 2): dm_num(b, n) = dm_num(b - 1, n) - 4 for b in [m + 1, n]. dm_num(m, n) = 0 for even n and 2 for odd n. dm_num(m - 1, n) = 6 - n for even n > 4 and 9 - n for odd n > 5, producing a sequence of first differences {+2, -4, +2, -4, ...}. Triangular patterns become clearly visible for large n, defined by additive periodicities along rational slopes. Zeros along the triangle borders correspond to ones in the Redheffer matrix until odd values become dominant. The line along m is the border between the two largest triangles. This pattern is masked by aliasing effects for small bases, notably including base 10, due to the thinness of the triangles which dominate at small b. Odd values may represent "artifacts" caused by "interference". LINKS Reikku Kulon, Rows of triangle for b in [2, 141] Reikku Kulon, C99 source to produce the triangle Reikku Kulon, Triangle as 2048x2048 PNG image (zero is white, primes are black and darker grays indicate fewer prime factors) Reikku Kulon, Prime band as 16384x256 PNG image (note the curves coincident with new strips of primes, as well as the second band which appears at 4096 and corresponds to the 637/638 gap in A031443) Eric Weisstein's World of Mathematics, Redheffer Matrix CROSSREFS Cf. A002321, A083058, A031443, A144777, A144798, A144799, A144800, A144801, A144812. Sequence in context: A065177 A064044 A213980 * A306708 A145337 A171941 Adjacent sequences:  A144909 A144910 A144911 * A144913 A144914 A144915 KEYWORD base,easy,frac,sign,tabl AUTHOR Reikku Kulon, Sep 25 2008, Oct 03 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 01:57 EST 2019. Contains 329948 sequences. (Running on oeis4.)