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

A190426 First differences of A132271 not in A132271.

Original entry on oeis.org

12, 23, 45, 56, 67, 89, 100, 244, 266, 288, 310, 332, 376, 398, 420, 696, 762, 795, 828, 861, 894, 927, 1222, 1368, 1412, 1456, 1500, 1544, 1588, 1632, 1676, 1720, 2260, 2315, 2370, 2425, 2480, 2535, 2590, 2645, 2700, 3372, 3438, 3504, 3570, 3636, 3702, 3768, 3834, 3900
Offset: 1

Views

Author

Robert G. Wilson v, May 10 2011

Keywords

Crossrefs

Cf. A132271.

Programs

  • Mathematica
    f[n_] := Block[{k = 0, p = 1}, While[a = Floor[n/10^k]; a > 0, p *= 1 + a; k++]; p]; t = Array[f, 591, 0]; Take[ Complement[ Union[ Rest@ t - Most@ t], t], 50]

A132272 a(n) = Product_{k>0} (1 + floor(n/10^k)).

Original entry on oeis.org

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

Views

Author

Hieronymus Fischer, Aug 20 2007

Keywords

Comments

If n is written in base-10 as n=d(m)d(m-1)d(m-2)...d(2)d(1)d(0) (where d(k) is the digit at position k) then a(n) is also the product (1+d(m)d(m-1)d(m-2)...d(2)d(1))*(1+d(m)d(m-1)d(m-2)...d(2))*...*(1+d(m)d(m-1)d(m-2))*(1+d(m)d(m-1))*(1+d(m)).
a(n) = A179051(n) for n < 100. [From Reinhard Zumkeller, Jun 27 2010]

Examples

			a(121)=(1+floor(121/10^1))*(1+floor(121/10^2))=13*2=26; a(132)=28 since 132=132(base-10) and so
a(132)=(1+13)*(1+1)(base-10)=14*2=28.
		

Crossrefs

For the product of terms floor(n/p^k) see A098844, A067080, A132027-A132033, A132263, A132264.

Programs

  • Maple
    A132272 := proc(n)
        a := 1;
        for k from 1 do
            f := floor(n/10^k) ;
            if f <=0 then
                return a;
            else
                a := a*(1+f) ;
            end if;
        end do:
    end proc:
    seq(A132272(n),n=1..120) ; # R. J. Mathar, Jun 13 2025
  • Mathematica
    Table[Product[1+Floor[n/10^k],{k,n}],{n,0,100}] (* Harvey P. Dale, Jul 20 2024 *)

Formula

The following formulas are given for a general parameter p considering the product of terms 1+floor(n/p^k) for 0
Recurrence: a(n)=(1+floor(n/p))*a(floor(n/p)); a(pn)=(1+n)*a(n); a(n*p^m)=product{0<=k
a(k*p^m-j)=k^m*p^(m(m-1)/2), for 0=1. a(p^m)=p^(m(m-1)/2)*product{0<=k
a(n)=A132271(floor(n/p))=A132271(n)/(1+n).
Asymptotic behavior: a(n)=O(n^((log_p(n)-1)/p)); this follows from the inequalities below.
a(n)<=A067080(n)/(n+1)*product{0<=k<=floor(log_p(n)), 1+1/p^k}.
a(n)>=A067080(n)/((n+1)*product{0
a(n)A000217(log_p(n))/(n+1), where c=product{k>0, 1+1/p^k}=2.2244691382741012... (for p=10 see constant A132325).
a(n)>n^((1+log_p(n))/2)/(n+1)=p^A000217(log_p(n))/(n+1).
lim sup n*a(n)/A067080(n)=2*product{k>0, 1+1/p^k}=2.2244691382741012..., for n-->oo (for p=10 see constant A132325).
lim inf n*a(n)/A067080(n)=1/product{k>0, 1-1/p^k}=1/0.8900100999989990000001000..., for n-->oo (for p=10 s. constant A132038).
lim inf a(n)/n^((1+log_p(n))/2)=1, for n-->oo.
lim sup a(n)/n^((1+log_p(n))/2)=2*product{k>0, 1+1/p^k}=2.2244691382741012..., for n-->oo (for p=10 see constant A132325).
lim inf a(n+1)/a(n)=2*product{k>0, 1+1/p^k}=2.2244691382741012... for n-->oo (for p=10 see constant A132325).

A132269 a(n) = Product_{k>=0} (1 + floor(n/2^k)).

Original entry on oeis.org

1, 2, 6, 8, 30, 36, 56, 64, 270, 300, 396, 432, 728, 784, 960, 1024, 4590, 4860, 5700, 6000, 8316, 8712, 9936, 10368, 18200, 18928, 21168, 21952, 27840, 28800, 31744, 32768, 151470, 156060, 170100, 174960, 210900, 216600, 234000, 240000, 340956, 349272, 374616
Offset: 0

Author

Hieronymus Fischer, Aug 20 2007

Keywords

Comments

If n is written in base 2 as n=d(m)d(m-1)d(m-2)...d(2)d(1)d(0) (where d(k) is the digit at position k) then a(n) is also the product (1+d(m)d(m-1)d(m-2)...d(2)d(1)d(0))*(1+d(m)d(m-1)d(m-2)...d(2)d(1))*(1+d(m)d(m-1)d(m-2)...d(2))*...*(1+d(m)d(m-1)d(m-2))*(1+d(m)d(m-1))*(1+d(m)).
From Gary W. Adamson, Aug 25 2016: (Start)
Given the following production matrix M =
1, 0, 0, 0, 0, ...
2, 0, 0, 0, 0, ...
0, 3, 0, 0, 0, ...
0, 4, 0, 0, 0, ...
0, 0, 5, 0, 0, ...
0, 0, 6, 0, 0, ...
0, 0, 0, 7, 0, ...
...
the sequence is the left-shifted vector as lim_{n->infinity} M^n. (End)

Examples

			a(10) = (1 + floor(10/2^0))*(1 + floor(10/2^1))*(1 + floor(10/2^2))*(1 + floor(10/2^3)) = 11*6*3*2 = 396;
a(17) = 4860 since 17 = 10001_2 and so a(17) = (1+10001_2)*(1+1000_2)*(1+100_2)*(1+10_2)*(1+1) = 18*9*5*3*2 = 4860.
		

Crossrefs

For formulas regarding a general parameter p (i.e., terms 1+floor(n/p^k)) see A132271.
For the product of terms floor(n/p^k) see A098844, A067080, A132027-A132033, A132263, A132264.

Programs

  • Magma
    [1] cat [n le 1 select 2 else (1+n)*Self(Floor(n/2)): n in [1..50]]; // Vincenzo Librandi, Aug 26 2016
  • Maple
    f:= proc(n) option remember; (1+n)*procname(floor(n/2)) end proc:
    f(0):= 1:
    map(f, [$0..100]); # Robert Israel, Aug 26 2016
  • Mathematica
    Table[Product[1 + Floor[2 n/2^k], {k, 2 n}], {n, 0, 42}] (* or *)
    Table[Function[w, Times @@ Map[1 + FromDigits[PadRight[w, #], 2] &, Range@ Length@ w]]@ IntegerDigits[n, 2], {n, 0, 42}] (* Michael De Vlieger, Aug 26 2016 *)

Formula

Recurrence: a(n)=(1+n)*a(floor(n/2)); a(2n)=(1+2n)*a(n); a(n*2^m) = (Product_{k=1..m} (1 + n*2^k))*a(n).
a(2^m-1) = 2^(m*(m+1)/2), a(2^m) = 2^(m*(m+1)/2)*Product_{k=0..m} (1 + 1/2^k), m>=1.
a(n) = A132270(2n) = (1+n)*A132270(n).
Asymptotic behavior: a(n) = O(n^((1+log_2(n))/2)); this follows from the inequalities below.
a(n) <= A098844(n)*Product_{k=0..floor(log_2(n))} (1 + 1/2^k).
a(n) >= A098844(n)/Product_{k=1..floor(log_2(n))} (1 - 1/2^k).
a(n) < c*n^((1+log_2(n))/2) = c*2^A000217(log_2(n)), where c = Product_{k>=0} (1 + 1/2^k) = 4.7684620580627... (see constant A081845).
a(n) > n^((1+log_2(n))/2) = 2^A000217(log_2(n)),
lim sup a(n)/A098844(n) = Product_{k>=0} (1 + 1/2^k) = 4.7684620580627..., for n->oo (see constant A081845).
lim inf a(n)/A098844(n) = 1/Product_{k>=1} (1 - 1/2^k) = 1/0.288788095086602421..., for n->oo (see constant A048651).
lim inf a(n)/n^((1+log_2(n))/2) = 1, for n->oo.
lim sup a(n)/n^((1+log_2(n))/2) = Product_{k>=0} (1 + 1/2^k) = 4.7684620580627..., for n->oo (see constant A081845).
lim inf a(n+1)/a(n) = Product_{k>=0} (1 + 1/2^k) = 4.7684620580627... for n->oo (see constant A081845).
G.f. g(x) satisfies g(x) = (1+2x)*g(x^2) + 2*x^2*(1+x)*g'(x^2). - Robert Israel, Aug 26 2016

A132327 a(n) = Product{k>=0} (1 + floor(n/3^k)).

Original entry on oeis.org

1, 2, 3, 8, 10, 12, 21, 24, 27, 80, 88, 96, 130, 140, 150, 192, 204, 216, 399, 420, 441, 528, 552, 576, 675, 702, 729, 2240, 2320, 2400, 2728, 2816, 2904, 3264, 3360, 3456, 4810, 4940, 5070, 5600, 5740, 5880, 6450, 6600, 6750, 8832, 9024, 9216, 9996, 10200
Offset: 0

Author

Hieronymus Fischer, Aug 20 2007

Keywords

Comments

If n is written in base-3 as n=d(m)d(m-1)d(m-2)...d(2)d(1)d(0) (where d(k) is the digit at position k) then a(n) is also the product (1+d(m)d(m-1)d(m-2)...d(2)d(1)d(0))*(1+d(m)d(m-1)d(m-2)...d(2)d(1))*(1+d(m)d(m-1)d(m-2)...d(2))*...*(1+d(m)d(m-1)d(m-2))*(1+d(m)d(m-1))*(1+d(m)).

Examples

			a(12)=(1+floor(12/3^0))*(1+floor(12/3^1))*(1+floor(12/3^2))=13*5*2=130; a(20)=441 since 20=202(base-3) and so
a(20)=(1+202)*(1+20)*(1+2)(base-3)=21*7*3=441.
		

Crossrefs

Cf. A100220, A132027, A132038, A132264, A132269(for p=2), A132271(for p=10).
For formulas regarding a general parameter p (i.e. terms 1+floor(n/p^k)) see A132271.
For the product of terms floor(n/p^k) see A098844, A067080, A132027-A132033, A132263, A132264.

Programs

  • Mathematica
    Table[Product[1+Floor[n/3^k],{k,0,n}],{n,0,49}] (* James C. McMahon, Mar 07 2025 *)

Formula

Recurrence: a(n)=(1+n)*a(floor(n/3)); a(3n)=(1+3n)*a(n); a(n*3^m)=product{1<=k<=m, 1+n*3^k}*a(n).
a(k*3^m-j)=(k*3^m-j+1)*3^m*p^(m(m-1)/2), for 0=1, a(3^m)=3^(m(m+1)/2)*product{0<=k<=m, 1+1/3^k}, m>=1.
a(n)=A132328(3*n)=(1+n)*A132328(n).
Asymptotic behavior: a(n)=O(n^((1+log_3(n))/2)); this follows from the inequalities below.
a(n)<=A132027(n)*product{0<=k<=floor(log_3(n)), 1+1/3^k}.
a(n)>=A132027(n)/product{1<=k<=floor(log_3(n)), 1-1/3^k}.
a(n)A000217(log_3(n)), where c=product{k>=0, 1+1/p^k}=3.12986803713402307587769821345767... (see constant A132323).
a(n)>n^((1+log_3(n))/2)=3^A000217(log_3(n)).
lim sup a(n)/A132027(n)=2*product{k>0, 1+1/3^k}=3.12986803713402307587769821345767..., for n-->oo (see constant A132323).
lim inf a(n)/A132027(n)=1/product{k>0, 1-1/3^k}=1/0.560126077927948944969792243314140014..., for n-->oo (see constant A100220).
lim inf a(n)/n^((1+log_3(n))/2)=1, for n-->oo.
lim sup a(n)/n^((1+log_3(n))/2)=2*product{k>0, 1+1/3^k}=3.12986803713402307587769821345767..., for n-->oo (see constant A132323).
lim inf a(n+1)/a(n)=2*product{k>0, 1+1/3^k}=3.12986803713402307587769821345767... for n-->oo (see constant A132323).

A132326 Decimal expansion of Product_{k>=1} (1+1/10^k).

Original entry on oeis.org

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

Author

Hieronymus Fischer, Aug 20 2007

Keywords

Comments

Half the constant A132325.

Examples

			1.1122345691370506321260780670944...
		

Programs

  • Mathematica
    digits = 105; NProduct[1+1/3^k, {k, 0, Infinity}, NProductFactors -> 100, WorkingPrecision -> digits+3] // N[#, digits+3]& // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 18 2014 *)
    N[QPochhammer[-1/10,1/10]] (* G. C. Greubel, Dec 01 2015 *)
  • PARI
    prodinf(k=1, 1+1/10^k) \\ Amiram Eldar, May 20 2023

Formula

Equals (1/2)*lim sup_{n->oo} Product_{0<=k<=floor(log_10(n))} (1+1/floor(n/10^k)).
Equals (1/2)*lim sup_{n->oo} A132271(n)/n^((1+log_10(n))/2).
Equals (1/2)*lim sup_{n->oo} A132272(n)/n^((log_10(n)-1)/2).
Equals exp(Sum_{n>0} 10^(-n)*Sum_{k|n} -(-1)^k/k) = exp(Sum_{n>0} A000593(n)/(n*10^n)).
Equals (1/2)*lim sup_{n->oo} A132271(n+1)/A132271(n).
Equals (-1/10; 1/10){infinity}, where (a;q){infinity} is the q-Pochhammer symbol. - G. C. Greubel, Dec 01 2015
Equals (sqrt(2)/2) * exp(log(10)/24 + Pi^2/(12*log(10))) * Product_{k>=1} (1 - exp(-2*(2*k-1)*Pi^2/log(10))) (McIntosh, 1995). - Amiram Eldar, May 20 2023

A132325 Decimal expansion of Product_{k>=0} (1+1/10^k).

Original entry on oeis.org

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

Author

Hieronymus Fischer, Aug 20 2007

Keywords

Comments

Twice the constant A132326.

Examples

			2.22446913827410126425215613418881160749501...
		

Programs

  • Mathematica
    digits = 105; NProduct[1+1/10^k, {k, 1, Infinity}, NProductFactors -> 100, WorkingPrecision -> digits+3] // N[#, digits+3]& // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 18 2014 *)
    2*N[QPochhammer[-1/10,1/10]] (* G. C. Greubel, Dec 02 2015 *)
  • PARI
    prodinf(x=0, 1+(1/10)^x) \\ Altug Alkan, Dec 03 2015

Formula

Equals lim sup_{n->oo} Product_{0<=k<=floor(log_10(n))} (1+1/floor(n/10^k)).
Equals lim sup_{n->oo} A132271(n)/n^((1+log_10(n))/2).
Equals lim sup_{n->oo} A132272(n)/n^((log_10(n)-1)/2).
Equals 2*exp(Sum_{n>0} 10^(-n)*Sum_{k|n} -(-1)^k/k) = 2*exp(Sum_{n>0} A000593(n)/(n*10^n)).
Equals lim sup_{n->oo} A132271(n+1)/A132271(n).
Equals 2*(-1/10; 1/10){infinity}, where (a;q){infinity} is the q-Pochhammer symbol. - G. C. Greubel, Dec 02 2015
Equals sqrt(2) * exp(log(10)/24 + Pi^2/(12*log(10))) * Product_{k>=1} (1 - exp(-2*(2*k-1)*Pi^2/log(10))) (McIntosh, 1995). - Amiram Eldar, May 20 2023
Showing 1-6 of 6 results.