A132270 -id:A132270 - cp's OEIS frontend

A004526 Nonnegative integers repeated, floor(n/2).

0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36

Offset: 0

N. J. A. Sloane

Number of elements in the set {k: 1 <= 2k <= n}.
Dimension of the space of weight 2n+4 cusp forms for Gamma_0(2).
Dimension of the space of weight 1 modular forms for Gamma_1(n+1).
Number of ways 2^n is expressible as r^2 - s^2 with s > 0. Proof: (r+s) and (r-s) both should be powers of 2, even and distinct hence a(2k) = a(2k-1) = (k-1) etc. - Amarnath Murthy, Sep 20 2002
Lengths of sides of Ulam square spiral; i.e., lengths of runs of equal terms in A063826. - Donald S. McDonald, Jan 09 2003
Number of partitions of n into two parts. A008619 gives partitions of n into at most two parts, so A008619(n) = a(n) + 1 for all n >= 0. Partial sums are A002620 (Quarter-squares). - Rick L. Shepherd, Feb 27 2004
a(n+1) is the number of 1's in the binary expansion of the Jacobsthal number A001045(n). - Paul Barry, Jan 13 2005
Number of partitions of n+1 into two distinct (nonzero) parts. Example: a(8) = 4 because we have [8,1],[7,2],[6,3] and [5,4]. - Emeric Deutsch, Apr 14 2006
Complement of A000035, since A000035(n)+2*a(n) = n. Also equal to the partial sums of A000035. - Hieronymus Fischer, Jun 01 2007
Number of binary bracelets of n beads, two of them 0. For n >= 2, a(n-2) is the number of binary bracelets of n beads, two of them 0, with 00 prohibited. - Washington Bomfim, Aug 27 2008
Let A be the Hessenberg n X n matrix defined by: A[1,j] = j mod 2, A[i,i]:=1, A[i,i-1] = -1, and A[i,j] = 0 otherwise. Then, for n >= 1, a(n+1) = (-1)^n det(A). - Milan Janjic, Jan 24 2010
From Clark Kimberling, Mar 10 2011: (Start)
Let RT abbreviate rank transform (A187224). Then
RT(this sequence) = A187484;
RT(this sequence without 1st term) = A026371;
RT(this sequence without 1st 2 terms) = A026367;
RT(this sequence without 1st 3 terms) = A026363. (End)
The diameter (longest path) of the n-cycle. - Cade Herron, Apr 14 2011
For n >= 3, a(n-1) is the number of two-color bracelets of n beads, three of them are black, having a diameter of symmetry. - Vladimir Shevelev, May 03 2011
Pelesko (2004) refers erroneously to this sequence instead of A008619. - M. F. Hasler, Jul 19 2012
Number of degree 2 irreducible characters of the dihedral group of order 2(n+1). - Eric M. Schmidt, Feb 12 2013
For n >= 3 the sequence a(n-1) is the number of non-congruent regions with infinite area in the exterior of a regular n-gon with all diagonals drawn. See A217748. - Martin Renner, Mar 23 2013
a(n) is the number of partitions of 2n into exactly 2 even parts. a(n+1) is the number of partitions of 2n into exactly 2 odd parts. This just rephrases the comment of E. Deutsch above. - Wesley Ivan Hurt, Jun 08 2013
Number of the distinct rectangles and square in a regular n-gon is a(n/2) for even n and n >= 4. For odd n, such number is zero, see illustration in link. - Kival Ngaokrajang, Jun 25 2013
x-coordinate from the image of the point (0,-1) after n reflections across the lines y = n and y = x respectively (alternating so that one reflection is applied on each step): (0,-1) -> (0,1) -> (1,0) -> (1,2) -> (2,1) -> (2,3) -> ... . - Wesley Ivan Hurt, Jul 12 2013
a(n) is the number of partitions of 2n into exactly two distinct odd parts. a(n-1) is the number of partitions of 2n into exactly two distinct even parts, n > 0. - Wesley Ivan Hurt, Jul 21 2013
a(n) is the number of permutations of length n avoiding 213, 231 and 312, or avoiding 213, 312 and 321 in the classical sense which are breadth-first search reading words of increasing unary-binary trees. For more details, see the entry for permutations avoiding 231 at A245898. - Manda Riehl, Aug 05 2014
Also a(n) is the number of different patterns of 2-color, 2-partition of n. - Ctibor O. Zizka, Nov 19 2014
Minimum in- and out-degree for a directed K_n (see link). - Jon Perry, Nov 22 2014
a(n) is also the independence number of the triangular graph T(n). - Luis Manuel Rivera Martínez, Mar 12 2015
For n >= 3, a(n+4) is the least positive integer m such that every m-element subset of {1,2,...,n} contains distinct i, j, k with i + j = k (equivalently, with i - j = k). - Rick L. Shepherd, Jan 24 2016
More generally, the ordinary generating function for the integers repeated k times is x^k/((1 - x)(1 - x^k)). - Ilya Gutkovskiy, Mar 21 2016
a(n) is the number of numbers of the form F(i)*F(j) between F(n+3) and F(n+4), where 2 < i < j and F = A000045 (Fibonacci numbers). - Clark Kimberling, May 02 2016
The arithmetic function v_2(n,2) as defined in A289187. - Robert Price, Aug 22 2017
a(n) is also the total domination number of the (n-3)-gear graph. - Eric W. Weisstein, Apr 07 2018
Consider the numbers 1, 2, ..., n; a(n) is the largest integer t such that these numbers can be arranged in a row so that all consecutive terms differ by at least t. Example: a(6) = a(7) = 3, because of respectively (4, 1, 5, 2, 6, 3) and (1, 5, 2, 6, 3, 7, 4) (see link BMO - Problem 2). - Bernard Schott, Mar 07 2020
a(n-1) is also the number of integer-sided triangles whose sides a < b < c are in arithmetic progression with a middle side b = n (see A307136). Example, for b = 4, there exists a(3) = 1 such triangle corresponding to Pythagorean triple (3, 4, 5). For the triples, miscellaneous properties and references, see A336750. - Bernard Schott, Oct 15 2020
For n >= 1, a(n-1) is the greatest remainder on division of n by any k in 1..n. - David James Sycamore, Sep 05 2021
Number of incongruent right triangles that can be formed from the vertices of a regular n-gon is given by a(n/2) for n even. For n odd such number is zero. For a regular n-gon, the number of incongruent triangles formed from its vertices is given by A069905(n). The number of incongruent acute triangles is given by A005044(n). The number of incongruent obtuse triangles is given by A008642(n-4) for n > 3 otherwise 0, with offset 0. - Frank M Jackson, Nov 26 2022
The inverse binomial transform is 0, 0, 1, -2, 4, -8, 16, -32, ... (see A122803). - R. J. Mathar, Feb 25 2023

			G.f. = x^2 + x^3 + 2*x^4 + 2*x^5 + 3*x^6 + 3*x^7 + 4*x^8 + 4*x^9 + 5*x^10 + ...

G. L. Alexanderson et al., The William Powell Putnam Mathematical Competition - Problems and Solutions: 1965-1984, M.A.A., 1985; see Problem A-1 of 27th Competition.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 120, P(n,2).
Graham, Knuth and Patashnik, Concrete Mathematics, Addison-Wesley, NY, 1989, page 77 (partitions of n into at most 2 parts).

David Wasserman, Table of n, a(n) for n = 0..1000
Jonathan Bloom and Nathan McNew, Counting pattern-avoiding integer partitions, arXiv:1908.03953 [math.CO], 2019.
British Mathematical Olympiad, 2011/2012 - Round 1 - Problem 2.
Shalosh B. Ekhad and Doron Zeilberger, In How many ways can I carry a total of n coins in my two pockets, and have the same amount in both pockets?, arXiv:1901.08172 [math.CO], 2019.
Ricardo Gómez Aíza, Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis, arXiv:2402.16111 [math.CO], 2024. See p. 23.
Andreas M. Hinz and Paul K. Stockmeyer, Precious Metal Sequences and Sierpinski-Type Graphs, J. Integer Seq., Vol 25 (2022), Article 22.4.8.
Zachary Hoelscher and Eyvindur Ari Palsson, Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to omega(t), arXiv:2011.14502 [math.NT], 2020.
Kival Ngaokrajang, The distinct rectangles and square in a regular n-gon for n = 4..18.
John A. Pelesko, Generalizing the Conway-Hofstadter $10,000 Sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.5.
Jon Perry, Square of a directed graph.
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N)).
William A. Stein, The modular forms database.
Eric Weisstein's World of Mathematics, Gear Graph.
Eric Weisstein's World of Mathematics, Prime Partition
Eric Weisstein's World of Mathematics, Total Domination Number.
Index entries for "core" sequences
Index to sequences related to Olympiads
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

a(n+2) = A008619(n). See A008619 for more references.
A001477(n) = a(n+1)+a(n). A000035(n) = a(n+1)-A002456(n).
a(n) = A008284(n, 2), n >= 1.
Zero followed by the partial sums of A000035.
Column 2 of triangle A094953. Second row of A180969.
Cf. A002264, A002265, A002266, A010761, A010762, A110532, A110533.
Partial sums: A002620. Other related sequences: A010872, A010873, A010874.
Cf. similar sequences of the integers repeated k times: A001477 (k = 1), this sequence (k = 2), A002264 (k = 3), A002265 (k = 4), A002266 (k = 5), A152467 (k = 6), A132270 (k = 7), A132292 (k = 8), A059995 (k = 10).
Cf. A289187, A139756 (binomial transf).
Cf. A307136, A336750.

a004526 = (`div` 2)
a004526_list = concatMap (\x -> [x, x]) [0..]
-- Reinhard Zumkeller, Jul 27 2012

[Floor(n/2): n in [0..100]]; // Vincenzo Librandi, Nov 19 2014

A004526 := n->floor(n/2); seq(floor(i/2),i=0..50);

Table[(2n - 1)/4 + (-1)^n/4, {n, 0, 70}] (* Stefan Steinerberger, Apr 02 2006 *)
f[n_] := If[OddQ[n], (n - 1)/2, n/2]; Array[f, 74, 0] (* Robert G. Wilson v, Apr 20 2012 *)
With[{c=Range[0,40]},Riffle[c,c]] (* Harvey P. Dale, Aug 26 2013 *)
CoefficientList[Series[x^2/(1 - x - x^2 + x^3), {x, 0, 75}], x] (* Robert G. Wilson v, Feb 05 2015 *)
LinearRecurrence[{1, 1, -1}, {0, 0, 1}, 75] (* Robert G. Wilson v, Feb 05 2015 *)
Floor[Range[0, 40]/2] (* Eric W. Weisstein, Apr 07 2018 *)

makelist(floor(n/2),n,0,50); /* Martin Ettl, Oct 17 2012 */

a(n)=n\2 /* Jaume Oliver Lafont, Mar 25 2009 */

x='x+O('x^100); concat([0, 0], Vec(x^2/((1+x)*(x-1)^2))) \\ Altug Alkan, Mar 21 2016

def a(n): return n//2
print([a(n) for n in range(74)]) # Michael S. Branicky, Apr 30 2022

def a(n) : return( dimension_cusp_forms( Gamma0(2), 2*n+4) ); # Michael Somos, Jul 03 2014

def a(n) : return( dimension_modular_forms( Gamma1(n+1), 1) ); # Michael Somos, Jul 03 2014

G.f.: x^2/((1+x)*(x-1)^2).
a(n) = floor(n/2).
a(n) = ceiling((n+1)/2). - Eric W. Weisstein, Jan 11 2024
a(n) = 1 + a(n-2).
a(n) = a(n-1) + a(n-2) - a(n-3).
a(2*n) = a(2*n+1) = n.
a(n+1) = n - a(n). - Henry Bottomley, Jul 25 2001
For n > 0, a(n) = Sum_{i=1..n} (1/2)/cos(Pi*(2*i-(1-(-1)^n)/2)/(2*n+1)). - Benoit Cloitre, Oct 11 2002
a(n) = (2*n-1)/4 + (-1)^n/4; a(n+1) = Sum_{k=0..n} k*(-1)^(n+k). - Paul Barry, May 20 2003
E.g.f.: ((2*x-1)*exp(x) + exp(-x))/4. - Paul Barry, Sep 03 2003
G.f.: (1/(1-x)) * Sum_{k >= 0} t^2/(1-t^4) where t = x^2^k. - Ralf Stephan, Feb 24 2004
a(n+1) = A000120(A001045(n)). - Paul Barry, Jan 13 2005
a(n) = (n-(1-(-1)^n)/2)/2 = (1/2)*(n-|sin(n*Pi/2)|). Likewise: a(n) = (n-A000035(n))/2. Also: a(n) = Sum_{k=0..n} A000035(k). - Hieronymus Fischer, Jun 01 2007
The expression floor((x^2-1)/(2*x)) (x >= 1) produces this sequence. - Mohammad K. Azarian, Nov 08 2007; corrected by M. F. Hasler, Nov 17 2008
a(n+1) = A002378(n) - A035608(n). - Reinhard Zumkeller, Jan 27 2010
a(n+1) = A002620(n+1) - A002620(n) = floor((n+1)/2)*ceiling((n+1)/2) - floor(n^2/4). - Jonathan Vos Post, May 20 2010
For n >= 2, a(n) = floor(log_2(2^a(n-1) + 2^a(n-2))). - Vladimir Shevelev, Jun 22 2010
a(n) = A180969(2,n). - Adriano Caroli, Nov 24 2010
A001057(n-1) = (-1)^n*a(n), n > 0. - M. F. Hasler, Jul 19 2012
a(n) = A008615(n) + A002264(n). - Reinhard Zumkeller, Apr 28 2014
Euler transform of length 2 sequence [1, 1]. - Michael Somos, Jul 03 2014

Partially edited by Joerg Arndt, Mar 11 2010, and M. F. Hasler, Jul 19 2012

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

Hieronymus Fischer, Aug 20 2007

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]

			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.

R. J. Mathar, Table of n, a(n) for n = 0..500

Cf. A132038, A132270(p=2), A132271, A132325, A132328(p=3), A132271.

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

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

Table[Product[1+Floor[n/10^k],{k,n}],{n,0,100}] (* Harvey P. Dale, Jul 20 2024 *)

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).

A079555 Decimal expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...

Original entry on oeis.org

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

Offset: 1

Benoit Cloitre, Jan 25 2003

			2.38423102903137172414989928867839723877161951650843345769...

G. C. Greubel, Table of n, a(n) for n = 1..1200
Richard J. McIntosh, Some Asymptotic Formulae for q-Hypergeometric Series, Journal of the London Mathematical Society, Vol. 51, No. 1 (1995), pp. 120-136; alternative link.

Cf. A028362, A048651, A081845, A098844, A100220, A132019-A132026, A132034-A132038, A132265-A132268, A132323-A132326, A132269, A132270, A000593.

Cf. A141848. - Gleb Koloskov, Apr 04 2021

digits = 105; NProduct[(1 + 1/2^k), {k, 1, Infinity}, WorkingPrecision -> digits+10, NProductFactors -> 200] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 14 2013 *)
N[QPochhammer[-1/2,1/2]] (* G. C. Greubel, Dec 05 2015 *)
1/N[QPochhammer[1/2, 1/4]] (* Gleb Koloskov, Apr 04 2021 *)

prodinf(n=1,1+2.^-n) \\ Charles R Greathouse IV, May 27 2015

1/prodinf(n=0, 1-2^(-2*n-1)) \\ Gleb Koloskov, Apr 04 2021

(1/2)*lim sup Product_{k=0..floor(log_2(n)), (1 + 1/floor(n/2^k))} for n-->oo. - Hieronymus Fischer, Aug 20 2007
(1/2)*lim sup A132369(n)/A098844(n) for n-->oo. - Hieronymus Fischer, Aug 20 2007
(1/2)*lim sup A132269(n)/n^((1+log_2(n))/2) for n-->oo. - Hieronymus Fischer, Aug 20 2007
(1/2)*lim sup A132270(n)/n^((log_2(n)-1)/2) for n-->oo. - Hieronymus Fischer, Aug 20 2007
exp(sum{n>0, 2^(-n)*sum{k|n, -(-1)^k/k}})=exp(sum{n>0, A000593(n)/(n*2^n)}). - Hieronymus Fischer, Aug 20 2007
(1/2)*lim sup A132269(n+1)/A132269(n)=2.3842310290313717241498992886... for n-->oo. - Hieronymus Fischer, Aug 20 2007
Equals (-1/2; 1/2){infinity}, where (a;q){infinity} is the q-Pochhammer symbol. - G. C. Greubel, Dec 05 2015
2 + Sum_{k>1} 1/(Product_{i=2..k} (2^i-1)) = 2 + 1/3 + 1/(3*7) + 1/(3*7*15) + 1/(3*7*15*31) + 1/(3*7*15*31*63) + ... (conjecture). - Werner Schulte, Dec 22 2016
From Peter Bala, Dec 15 2020: (Start)
The above conjecture of Schulte follows by setting x = 1/2 and t = -1 in the identity Product_{k >= 1} (1 - t*x^k) = Sum_{n >= 0} (-1)^n*x^(n*(n+1)/2)*t^n/( Product_{k = 1..n} 1 - x^k ), due to Euler.
Constant C = 1 + Sum_{n >= 0} (1/2)^(n+1)*Product_{k = 1..n} (1 + 1/2^k).
C = 2 + Sum_{n >= 0} (1/4)^(n+1)*Product_{k = 1..n} (1 + 1/2^k).
3*C = 7 + Sum_{n >= 0} (1/8)^(n+1)*Product_{k = 1..n} (1 + 1/2^k).
3*7*C = 50 + Sum_{n >= 0} (1/16)^(n+1)*Product_{k = 1..n} (1 + 1/2^k).
3*7*15*C = 751 + Sum_{n >= 0} (1/32)^(n+1)*Product_{k = 1..n} (1 + 1/2^k).
(End)
Equals 1/(1-P), where P is the Pell constant from A141848. - Gleb Koloskov, Apr 04 2021
Equals Sum_{k>=0} A000009(k)/2^k. - Vaclav Kotesovec, Sep 15 2021
From Amiram Eldar, Feb 19 2022: (Start)
Equals (sqrt(2)/2) * exp(log(2)/24 + Pi^2/(12*log(2))) * Product_{k>=1} (1 - exp(-2*(2*k-1)*Pi^2/log(2))) (McIntosh, 1995).
Equals (1/2) * A081845.
Equals Sum_{n>=0} 1/A005329(n). (End)

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

Original entry on oeis.org

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

Offset: 1

Benoit Cloitre, Apr 09 2003

Twice the product in A079555.

			4.76846205806274344829979857....

G. C. Greubel, Table of n, a(n) for n = 1..2000
Richard J. McIntosh, Some Asymptotic Formulae for q-Hypergeometric Series, Journal of the London Mathematical Society, Vol. 51, No. 1 (1995), pp. 120-136; citeseerx.
József Sándor, On Vandiver's arithmetical function - I, Notes on Number Theory and Discrete Mathematics, Vol. 27, No. 3 (2021), pp. 29-38. See p. 36, eq. 40.

Cf. A006125, A020696, A028361, A079555, A083864.

Cf. A000593, A048651, A100220, A098844, A132019-A132026, A132034-A132038, A132265-A132268, A132323-A132326, A132269, A132270.

digits = 105; NProduct[1 + 1/2^k, {k, 0, Infinity}, WorkingPrecision -> digits+5, NProductFactors -> digits] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Mar 04 2013 *)
N[QPochhammer[-1, 1/2], 100] (* Vaclav Kotesovec, Dec 13 2015 *)
2*N[QPochhammer[-1/2, 1/2], 200] (* G. C. Greubel, Dec 20 2015 *)

prodinf(k=0,1/2^k,1) \\ Hugo Pfoertner, Feb 21 2020

lim sup Product_{k=0..floor(log_2(n))} (1 + 1/floor(n/2^k)) for n-->oo. - Hieronymus Fischer, Aug 20 2007
lim sup A132369(n)/A098844(n) for n-->oo. - Hieronymus Fischer, Aug 20 2007
lim sup A132269(n)/n^((1+log_2(n))/2) for n-->oo. - Hieronymus Fischer, Aug 20 2007
lim sup A132270(n)/n^((log_2(n)-1)/2) for n-->oo. - Hieronymus Fischer, Aug 20 2007
2*exp(Sum_{n>0} 2^(-n)*Sum_{k|n} -(-1)^k/k) = 2*exp(Sum_{n>0} A000593(n)/(n*2^n)). - Hieronymus Fischer, Aug 20 2007
lim sup A132269(n+1)/A132269(n) = 4.76846205806274344... for n-->oo. - Hieronymus Fischer, Aug 20 2007
Sum_{k>=1} (-1)^(k+1) * 2^k / (k*(2^k-1)) = log(A081845) = 1.562023833218500307570359922772014353168080202860122... . - Vaclav Kotesovec, Dec 13 2015
Equals 2*(-1/2; 1/2){infinity}, where (a;q){infinity} is the q-Pochhammer symbol. - G. C. Greubel, Dec 20 2015
Equals 1 + Sum_{n>=1} 2^n/((2-1)*(2^2-1)*...*(2^n-1)). - Robert FERREOL, Feb 21 2020
From Peter Bala, Jan 18 2021: (Start)
Constant C = 3*Sum_{n >= 0} (1/2)^n/Product_{k = 1..n} (2^k - 1).
Faster converging series:
C = (2*3*5)/(2^3)*Sum_{n >= 0} (1/4)^n/Product_{k = 1..n} (2^k - 1),
C = (2*3*5*9)/(2^6)*Sum_{n >= 0} (1/8)^n/Product_{k = 1..n} (2^k - 1),
C = (2*3*5*9*17)/(2^10)*Sum_{n >= 0} (1/16)^n/Product_{k = 1..n} (2^k - 1), and so on. The sequence [2,3,5,9,17,...] is A000051. (End)
From Amiram Eldar, Mar 20 2022: (Start)
Equals sqrt(2) * exp(log(2)/24 + Pi^2/(12*log(2))) * Product_{k>=1} (1 - exp(-2*(2*k-1)*Pi^2/log(2))) (McIntosh, 1995).
Equals 1/A083864. (End)
Equals lim_{n->oo} A020696(2^n)/A006125(n+1) (Sándor, 2021). - Amiram Eldar, Jun 29 2022

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

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 3, 3, 8, 8, 8, 10, 10, 10, 12, 12, 12, 21, 21, 21, 24, 24, 24, 27, 27, 27, 80, 80, 80, 88, 88, 88, 96, 96, 96, 130, 130, 130, 140, 140, 140, 150, 150, 150, 192, 192, 192, 204, 204, 204, 216, 216, 216, 399, 399, 399, 420, 420, 420, 441, 441, 441, 528

Offset: 0

Hieronymus Fischer, Aug 20 2007

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))*(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(12)=(1+floor(12/3^1))*(1+floor(12/3^2))=5*2=10; a(19)=21 since 19=201(base-3) and so a(19)=(1+20)*(1+2)(base-3)=7*3=21.

Robert Israel, Table of n, a(n) for n = 0..10000

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

f:= proc(n) option remember; local t;
  t:= floor(n/3);
  (1+t)*procname(t)
end proc:
f(0):= 1: f(1):= 1: f(2):= 1:
map(f, [$0..100]); # Robert Israel, Oct 20 2020

(* Using definition *)
Table[Product[1 + Floor[n/3^k], {k, IntegerLength[n, 3] - 1}], {n, 0, 100}]
(* Using recurrence -- faster *)
a[0] = 1; a[n_] := a[n] = (1 + #)*a[#] & [Floor[n/3]];
Table[a[n], {n, 0, 100}] (* Paolo Xausa, Sep 23 2024 *)

Recurrence: a(n)=(1+floor(n/3))*a(floor(n/3)); a(3n)=(1+n)*a(n); a(n*3^m)=product{0<=k

a(k*3^m-j)=k^m*3^(m(m-1)/2), for 0=1. a(3^m)=p^(m(m-1)/2)*product{0<=k

a(n)=A132327(floor(n/3))=A132327(n)/(1+n).

Asymptotic behavior: a(n)=O(n^((log_3(n)-1)/p)); this follows from the inequalities below.

a(n)<=A132027(n)/(n+1)*product{0<=k<=floor(log_3(n)), 1+1/3^k}.

a(n)>=A132027(n)/((n+1)*product{0

a(n)A000217(log_3(n))/(n+1), where c=product{k>0, 1+1/3^k}=3.12986803713402307587769821345767... (see constant A132323).

a(n)>n^((1+log_3(n))/2)/(n+1)=3^A000217(log_3(n))/(n+1).

lim sup n*a(n)/A132027(n)=2*product{k>0, 1+1/3^k}=3.12986803713402307587769821345767..., for n-->oo (see constant A132323).

lim inf n*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).

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

Hieronymus Fischer, Aug 20 2007

nonn

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)

			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.

Robert Israel, Table of n, a(n) for n = 0..10000

Cf. A048651, A081845, A132270, A132271(p=10), A132272, A132327(p=3), A132328.
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.

[1] cat [n le 1 select 2 else (1+n)*Self(Floor(n/2)): n in [1..50]]; // Vincenzo Librandi, Aug 26 2016

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

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 *)

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

A256067 Irregular table T(n,k): the number of partitions of n where the least common multiple of all parts equals k.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 0, 0, 1, 0, 1, 1, 4, 2, 4, 1, 5, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 4, 3, 4, 1, 7, 1, 1, 1, 2, 0, 2, 0, 1, 1, 0, 0, 0, 0, 1, 1, 5, 3, 6, 2, 9, 1, 2, 1, 3, 0, 4, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 3, 6, 2

Offset: 0

R. J. Mathar, Mar 18 2015

			The 5 partitions of n=4 are 1+1+1+1 (lcm=1), 1+1+2 (lcm=2), 2+2 (lcm=2), 1+3 (lcm=3) and 4 (lcm=4). So k=1, 3 and 4 appear once, k=2 appears twice.
The triangle starts:
  1 ;
  1 ;
  1  1;
  1  1  1;
  1  2  1  1;
  1  2  1  1  1  1;
  1  3  2  2  1  2;
  1  3  2  2  1  3  1  0  0  1  0  1;
  ...

Alois P. Heinz, Rows n = 0..30, flattened

Cf. A000041 (row sums), A000793 (row lengths), A213952, A074761 (diagonal), A074752 (6th column), A008642 (4th column), A002266 (5th column), A002264 (3rd column), A132270 (7th column), A008643 (8th column), A008649 (9th column), A258470 (10th column).

Cf. A009490 (number of nonzero terms of rows), A074064 (last elements of rows), A168532 (the same for gcd), A181844 (Sum k*T(n,k)).

A256067 := proc(n,k)
        local a,p ;
        a := 0 ;
        for p in combinat[partition](n) do
                ilcm(op(p)) ;
                if % = k then
                        a := a+1 ;
                end if;
        end do:
        a;
end proc:
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0 or i=1, x,
      b(n, i-1)+(p-> add(coeff(p, x, t)*x^ilcm(t, i),
      t=1..degree(p)))(add(b(n-i*j, i-1), j=1..n/i)))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n$2)):
seq(T(n), n=0..12);  # Alois P. Heinz, Mar 27 2015

b[n_, i_] := b[n, i] = If[n == 0 || i == 1, x, b[n, i-1] + Function[{p}, Sum[ Coefficient[p, x, t]*x^LCM[t, i], {t, 1, Exponent[p, x]}]][Sum[b[n-i*j, i-1], {j, 1, n/i}]]]; T[n_] := Function[{p}, Table[Coefficient[p, x, i], {i, 1, Exponent[p, x]}]][b[n, n]]; Table[T[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Jun 22 2015, after Alois P. Heinz *)

T(0,1)=1 prepended by Alois P. Heinz, Mar 27 2015

A004777 Numbers not congruent to 7 mod 8.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77

Offset: 1

N. J. A. Sloane

Numbers that are congruent to {0, 1, 2, 3, 4, 5, 6} mod 8.
Numbers n such that binary expansion does not end 111.
Complement of A004771. - Michel Marcus, Sep 11 2015

Daniel Starodubtsev, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1).

Cf. A004771, A059561, A132270.

[n-1+Floor((n-1)/7) : n in [1..100]]; // Wesley Ivan Hurt, Sep 11 2015

[n: n in [0..100] | not n mod 8 in [7]]; // Vincenzo Librandi, Sep 11 2015

A004777:=n->n-1+floor((n-1)/7): seq(A004777(n), n=1..100); # Wesley Ivan Hurt, Sep 11 2015

DeleteCases[Range[0,100],?(Mod[#,8]==7&)] (* _Harvey P. Dale, Apr 01 2011 *)
Select[Range[0, 100], ! MemberQ[{7}, Mod[#, 8]] &] (* Vincenzo Librandi, Sep 12 2015 *)

A004777=n->(n-1)*8\7 \\ M. F. Hasler, Nov 02 2013

G.f.: x^2*(1+x+x^2+x^3+x^4+x^5+2*x^6) / ((x^6+x^5+x^4+x^3+x^2+x+1)*(x-1)^2). - R. J. Mathar, Oct 08 2011
a(n) = floor((n-1)*8/7). - M. F. Hasler, Nov 02 2013
From Wesley Ivan Hurt, Sep 11 2015: (Start)
a(n) = a(n-1) + a(n-7) - a(n-8) for n>8.
a(n) = n - 1 + A132270(n). (End)
From Wesley Ivan Hurt, Jul 20 2016: (Start)
a(n) = (56*n - 77 + (n mod 7) + ((n+1) mod 7) + ((n+2) mod 7) + ((n+3) mod 7) + ((n+4) mod 7) + ((n+5) mod 7) - 6*((n+6) mod 7))/49.
a(7k) = 8k-2, a(7k-1) = 8k-3, a(7k-2) = 8k-4, a(7k-3) = 8k-5, a(7k-4) = 8k-6, a(7k-5) = 8k-7, a(7k-6) = 8k-8. (End)

Edited by N. J. A. Sloane Aug 31 2009 at the suggestion of R. J. Mathar.

A256554 Number T(n,k) of cycle types of degree-n permutations having the k-th smallest possible order; triangle T(n,k), n>=0, 1<=k<=A009490(n), read by rows.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 1, 1, 1, 4, 2, 4, 1, 5, 1, 1, 1, 1, 1, 1, 4, 3, 4, 1, 7, 1, 1, 1, 2, 2, 1, 1, 1, 1, 5, 3, 6, 2, 9, 1, 2, 1, 3, 4, 1, 1, 1, 1, 1, 1, 5, 3, 6, 2, 12, 1, 2, 1, 4, 1, 6, 2, 2, 1, 2, 1, 1, 1, 2

Offset: 0

Alois P. Heinz, Apr 01 2015

Sum_{k>=0} A256553(n,k)*T(n,k) = A181844(n).

			Triangle T(n,k) begins:
  1;
  1;
  1, 1;
  1, 1, 1;
  1, 2, 1, 1;
  1, 2, 1, 1, 1, 1;
  1, 3, 2, 2, 1, 2;
  1, 3, 2, 2, 1, 3, 1, 1, 1;
  1, 4, 2, 4, 1, 5, 1, 1, 1, 1, 1;
  1, 4, 3, 4, 1, 7, 1, 1, 1, 2, 2, 1, 1, 1;
  1, 5, 3, 6, 2, 9, 1, 2, 1, 3, 4, 1, 1, 1, 1, 1;

Alois P. Heinz, Rows n = 0..60, flattened

Row sums give A000041.
Row lengths give A009490.
Columns k=1-9 give: A000012, A004526, A002264, A008642(n-4), A002266, A074752, A132270, A008643(n-8) for n>7, A008649(n-9) for n>8.
Last elements of rows give A074064.
Main diagonal gives A074761.
Cf. A181844, A256067, A256553.

b:= proc(n, i) option remember; `if`(n=0 or i=1, x,
      b(n, i-1)+(p-> add(coeff(p, x, t)*x^ilcm(t, i),
      t=1..degree(p)))(add(b(n-i*j, i-1), j=1..n/i)))
    end:
T:= n->(p->seq((h->`if`(h=0, [][], h))(coeff(p, x, i))
     , i=1..degree(p)))(b(n$2)):
seq(T(n), n=0..12);

b[n_, i_] := b[n, i] = If[n == 0 || i == 1, x, b[n, i - 1] + Function[p, Sum[Coefficient[p, x, t]*x^LCM[t, i], {t, 1, Exponent[p, x]}]][Sum[b[n - i*j, i - 1], {j, 1, n/i}]]]; T[n_] := Function[p, Table[Function[h, If[h == 0, {{}, {}}, h]][Coefficient[p, x, i]], {i, 1, Exponent[p, x]}]][b[n, n]]; Table[T[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Jan 23 2017, translated from Maple *)

A343609 a(n) = floor(n/9).

Original entry on oeis.org

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

Offset: 0

M. F. Hasler, May 19 2021

Also: Nonnegative integers repeated 9 times (with natural offset 0).

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,1,-1).

Cf. A004526 ([n/2]), A002264 ([n/3]), A002265 ([n/4]), A002266 ([n/5]), A152467 ([n/6]), A132270 ([(n-1)/7]), A132292 ([(n-1)/8]), A059995 ([n/10]), A344420 ([n/11]), A342696 ([n/12]).

Repunits A002275 = A343609 o A011557.

A343609 := n -> iquo(n,9); # illustration: map( A343609, [$0..99] );

A343609[n_] := Floor[n/9]
a[n_] := Quotient[n, 9]; Array[a, 100, 0] (* Amiram Eldar, May 19 2021 *)
LinearRecurrence[{1,0,0,0,0,0,0,0,1,-1},{0,0,0,0,0,0,0,0,0,1},100] (* Harvey P. Dale, Mar 01 2025 *)

PARI
```
apply( A343609(n)=n\9, [0..99])
```

a(n) = A002264(A002264(n)).
a(n) = a(n-1) + a(n-9) - a(n-10), n > 9;
G.f.: x^9/(1 - x - x^9 + x^10).

Showing 1-10 of 12 results. Next

cp's OEIS Frontend

A004526 Nonnegative integers repeated, floor(n/2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Sage

Sage

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A079555 Decimal expansion of Product_{k>=1} (1 + 1/2^k) = 2.384231029031371...

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs