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

A341680 Successive approximations up to 2^n for the 2-adic integer Sum_{k>=0} k!.

Original entry on oeis.org

0, 0, 2, 2, 10, 26, 26, 26, 26, 26, 538, 538, 2586, 6682, 14874, 31258, 64026, 129562, 129562, 391706, 915994, 1964570, 4061722, 8256026, 8256026, 8256026, 8256026, 8256026, 142473754, 410909210, 947780122, 2021521946, 4169005594, 8463972890, 8463972890, 25643842074
Offset: 0

Views

Author

Jianing Song, Feb 17 2021

Keywords

Comments

a(n) == Sum_{k>=0} k! (mod 2^n). Since k! mod 2^n is eventually zero, a(n) is well-defined.
In general, for every prime p, the p-adic integer x = Sum_{k>=0} k! is well-defined. To find the approximation up to p^n (n > 0) for x, it is enough to add k! for 0 <= k <= m and then find the remainder of the sum modulo p^n, where m = (p - 1)*(n + floor(log_p((p-1)*n))). This is because p^n divides (m+1)!

Examples

			For n = 9, since 2^9 divides 12!, we have a(9) = (Sum_{k=0..11} k!) mod 2^9 = 26.
For n = 12, since 2^12 divides 16!, we have a(12) = (Sum_{k=0..15} k!) mod 2^12 = 2586.

Links

Crossrefs

Cf. A341684 (digits of Sum_{k>=0} k!).
Successive approximations for the p-adic integer Sum_{k>=0} k!: A341680 (this sequence), A341681 (p=3), A341682 (p=5), A341683 (p=7).
Cf. A007843 (least positive integer k for which 2^n divides k!).

Programs

  • PARI
    a(n) = my(p=2); if(n==0, 0, lift(sum(k=0, (p-1)*(n+logint((p-1)*n, p)), Mod(k!, p^n))))

Formula

For n > 0, a(n) = (Sum_{k=0..m} k!) mod 2^n, where m = n + floor(log_2(n)).

A341682 Successive approximations up to 5^n for the 5-adic integer Sum_{k>=0} k!.

Original entry on oeis.org

0, 4, 14, 64, 314, 2814, 2814, 2814, 237189, 1018439, 1018439, 10784064, 10784064, 743205939, 1963909064, 20274455939, 142344768439, 142344768439, 142344768439, 7771739299689, 64992198284064, 446461924846564, 1876973399455939, 4261159190471564, 16182088145549689, 16182088145549689
Offset: 0

Views

Author

Jianing Song, Feb 17 2021

Keywords

Comments

a(n) == Sum_{k>=0} k! (mod 5^n). Since k! mod 5^n is eventually zero, a(n) is well-defined.
In general, for every prime p, the p-adic integer x = Sum_{k>=0} k! is well-defined. To find the approximation up to p^n (n > 0) for x, it is enough to add k! for 0 <= k <= m and then find the remainder of the sum modulo p^n, where m = (p - 1)*(n + floor(log_p((p-1)*n))). This is because p^n divides (m+1)!

Examples

			For n = 7, since 5^7 divides 30!, we have a(7) = (Sum_{k=0..29} k!) mod 5^7 = 2814.
For n = 29, since 5^29 divides 125!, we have a(29) = (Sum_{k=0..124} k!) mod 5^29 = 173465698384532268439.

Links

Crossrefs

Cf. A341686 (digits of Sum_{k>=0} k!).
Successive approximations for the p-adic integer Sum_{k>=0} k!: A341680 (p=2), A341681 (p=3), this sequence (p=5), A341683 (p=7).
Cf. A007845 (least positive integer k for which 2^n divides k!).

Programs

  • PARI
    a(n) = my(p=5); if(n==0, 0, lift(sum(k=0, (p-1)*(n+logint((p-1)*n, p)), Mod(k!, p^n))))

Formula

For n > 0, a(n) = (Sum_{k=0..m} k!) mod 5^n, where m = 4*(n + floor(log_5(4*n))).

A341683 Successive approximations up to 7^n for the 7-adic integer Sum_{k>=0} k!.

Original entry on oeis.org

0, 6, 48, 97, 440, 14846, 31653, 31653, 1678739, 1678739, 122739560, 1535115805, 3512442548, 58877591352, 155766601759, 2190435820306, 30675804879964, 97141666019166, 97141666019166, 3353968861840064, 48949549603332636, 288326348496168639
Offset: 0

Views

Author

Jianing Song, Feb 17 2021

Keywords

Comments

a(n) == Sum_{k>=0} k! (mod 7^n). Since k! mod 7^n is eventually zero, a(n) is well-defined.
In general, for every prime p, the p-adic integer x = Sum_{k>=0} k! is well-defined. To find the approximation up to p^n (n > 0) for x, it is enough to add k! for 0 <= k <= m and then find the remainder of the sum modulo p^n, where m = (p - 1)*(n + floor(log_p((p-1)*n))). This is because p^n divides (m+1)!

Examples

			For n = 7, since 7^7 divides 49!, we have a(7) = (Sum_{k=0..48} k!) mod 7^7 = 31653.
For n = 55, since 7^55 divides 343!, we have a(55) = (Sum_{k=0..342} k!) mod 7^55 = 7563765912082524448071111141811678897409320968.

Links

Crossrefs

Cf. A341687 (digits of Sum_{k>=0} k!).
Successive approximations for the p-adic integer Sum_{k>=0} k!: A341680 (p=2), A341681 (p=3), A341682 (p=5), this sequence (p=7).
Cf. A020646 (least positive integer k for which 7^n divides k!).

Programs

  • PARI
    a(n) = my(p=7); if(n==0, 0, lift(sum(k=0, (p-1)*(n+logint((p-1)*n, p)), Mod(k!, p^n))))

Formula

For n > 0, a(n) = (Sum_{k=0..m} k!) mod 7^n, where m = 6*(n + floor(log_7(6*n))).

A341685 Expansion of the 3-adic integer Sum_{k>=0} k!.

Original entry on oeis.org

1, 0, 1, 2, 1, 0, 1, 1, 0, 2, 0, 2, 1, 2, 0, 0, 0, 2, 2, 0, 2, 0, 0, 2, 1, 2, 0, 0, 1, 2, 2, 0, 2, 1, 0, 2, 0, 1, 2, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 2, 0, 2, 2, 0, 1, 0, 1, 0, 1, 2, 1, 2, 1, 2, 0, 1, 2, 1, 1, 1, 0, 0, 1, 2, 2, 1, 1, 1, 0, 2, 0, 1, 0, 0, 2, 0, 0, 2, 2, 1
Offset: 0

Views

Author

Jianing Song, Feb 17 2021

Keywords

Comments

For every prime p, since valuation(k!,p) goes to infinity as k increases, Sum_{k>=0} k! is a well-defined p-adic constant.
Conjecture: this constant is transcendental, which means that it is not the root of any polynomial with integer coefficients.
Conjecture: this constant is normal, which means for every ternary (base-3) string s with length k, if we denote N(s,n) as the number of occurrences of s in the first n digits, then lim_{n->inf} N(s,n)/n = 1/3^k.

Examples

			Sum_{k>=0} k! = ...00210201202210021200202200021202011012101.

Links

Crossrefs

Cf. A341681 (successive approximations of Sum_{k>=0} k!).
Expansion of Sum_{k>=0} k! in p-adic integers: A341684 (p=2), this sequence (p=3), A341686 (p=5), A341687 (p=7).

Programs

  • PARI
    a(n) = my(p=3); lift(sum(k=0, (p-1)*((n+1)+logint((p-1)*(n+1), p)), Mod(k!, p^(n+1)))) \ p^n

Formula

a(n) = (A341681(n+1) - A341681(n))/3^n.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.