A052268 -id:A052268 - cp's OEIS frontend

A200139 Triangle T(n,k), read by rows, given by (1,1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

1, 1, 1, 2, 3, 1, 4, 8, 5, 1, 8, 20, 18, 7, 1, 16, 48, 56, 32, 9, 1, 32, 112, 160, 120, 50, 11, 1, 64, 256, 432, 400, 220, 72, 13, 1, 128, 576, 1120, 1232, 840, 364, 98, 15, 1, 256, 1280, 2816, 3584, 2912, 1568, 560, 128, 17, 1, 512, 2816, 6912, 9984, 9408, 6048, 2688, 816, 162, 19, 1

Offset: 0

Philippe Deléham, Nov 13 2011

Riordan array ((1-x)/(1-2x),x/(1-2x)).
Product A097805*A007318 as infinite lower triangular arrays.
Product A193723*A130595 as infinite lower triangular arrays.
T(n,k) is the number of ways to place n unlabeled objects into any number of labeled bins (with at least one object in each bin) and then designate k of the bins. - Geoffrey Critzer, Nov 18 2012
Apparently, rows of this array are unsigned diagonals of A028297. - Tom Copeland, Oct 11 2014
Unsigned A118800, so my conjecture above is true. - Tom Copeland, Nov 14 2016

			Triangle begins:
   1
   1,   1
   2,   3,   1
   4,   8,   5,   1
   8,  20,  18,   7,   1
  16,  48,  56,  32,   9,   1
  32, 112, 160, 120,  50,  11,   1

Cf. A118800 (signed version), A081277, A039991, A001333 (antidiagonal sums), A025192 (row sums); diagonals: A000012, A005408, A001105, A002492, A072819l; columns: A011782, A001792, A001793, A001794, A006974, A006975, A006976.

Cf. A007318, A028297, A059260, A097805, A118801, A130595.

nn=15;f[list_]:=Select[list,#>0&];Map[f,CoefficientList[Series[(1-x)/(1-2x-y x) ,{x,0,nn}],{x,y}]]//Grid  (* Geoffrey Critzer, Nov 18 2012 *)

T(n,k) = 2*T(n-1,k)+T(n-1,k-1) with T(0,0)=T(1,0)=T(1,1)=1 and T(n,k)=0 for k<0 or for n

T(n,k) = A011782(n-k)*A135226(n,k) = 2^(n-k)*(binomial(n,k)+binomial(n-1,k-1))/2.

Sum_{k, 0<=k<=n} T(n,k)*x^k = A000007(n), A011782(n), A025192(n), A002001(n), A005054(n), A052934(n), A055272(n), A055274(n), A055275(n), A052268(n), A055276(n), A196731(n) for n=-1,0,1,2,3,4,5,6,7,8,9,10 respectively.

G.f.: (1-x)/(1-(2+y)*x).

T(n,k) = Sum_j>=0 T(n-1-j,k-1)*2^j.

T = A007318*A059260, so the row polynomials of this entry are given umbrally by p_n(x) = (1 + q.(x))^n, where q_n(x) are the row polynomials of A059260 and (q.(x))^k = q_k(x). Consequently, the e.g.f. is exp[tp.(x)] = exp[t(1+q.(x))] = e^t exp(tq.(x)) = [1 + (x+1)e^((x+2)t)]/(x+2), and p_n(x) = (x+1)(x+2)^(n-1) for n > 0. - Tom Copeland, Nov 15 2016

T^(-1) = A130595*(padded A130595), differently signed A118801. Cf. A097805. - Tom Copeland, Nov 17 2016

The n-th row polynomial in descending powers of x is the n-th Taylor polynomial of the rational function (1 + x)/(1 + 2*x) * (1 + 2*x)^n about 0. For example, for n = 4, (1 + x)/(1 + 2*x) * (1 + 2*x)^4 = (8*x^4 + 20*x*3 + 18*x^2 + 7*x + 1) + O(x^5). - Peter Bala, Feb 24 2018

A263479 Total number of n-digit positive integers with multiplicative digital root value 5.

Original entry on oeis.org

1, 6, 33, 132, 435, 1466, 5341, 18656, 58029, 159430, 392601, 882036, 1836159, 3586506, 6638885, 11738656, 19952441, 32768742, 52220113, 81029700, 122785131, 182142906, 265066605, 379102400, 533695525, 740551526, 1014046281, 1371688948, 1834642167, 2428304010

Offset: 1

Martin Renner, Oct 19 2015

First differences of A263473.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A031347, A034052, A263473.

Last /@ Tally@ IntegerLength@ Select[Range@ 1000000, FixedPoint[Times @@ IntegerDigits@ # &, #] == 5 &] (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 5, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263476(n) + A000012(n) + A263477(n) + A000027(n) + A263478(n) + a(n) + A263480(n) + A000027(n) + A263481(n) + A000217(n) = A052268(n).
a(n) = (1/720)*(3*n^8 + 6*n^7 - 664*n^6 + 6270*n^5 - 25783*n^4 + 55164*n^3 - 57796*n^2 + 23520*n). - Sergio Pimentel, Mar 27 2024
From Chai Wah Wu, Apr 17 2024: (Start)
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9) for n > 9.
G.f.: x*(235*x^7 - 205*x^6 - 161*x^5 - 57*x^4 + 33*x^3 - 15*x^2 + 3*x - 1)/(x - 1)^9. (End)

a(9)-a(30) from Hiroaki Yamanouchi, Oct 25 2015

A346509 Number of positive integers with n digits that are the product of two integers greater than 1 and ending with 1.

Original entry on oeis.org

0, 0, 12, 200, 2660, 31850, 361985, 3982799, 42914655, 455727689, 4788989458, 49930700093, 517443017072, 5336861879564

Offset: 1

Stefano Spezia, Jul 21 2021

a(n) is the number of n-digit numbers in A346507.

Cf. A017281, A052268, A087630, A337855 (ending with 5), A337856 (ending with 6), A346507.

a(n) = {my(res = 0); forstep(i = 10^(n-1) + 1, 10^n, 10, f = factor(i); if(bigomega(f) == 1, next); d = divisors(f); for(j = 2, (#d~ + 1)>>1, if(d[j]%10 == 1 && d[#d + 1 - j]%10 == 1, res++; next(2) ) ) ); res } \\ David A. Corneth, Jul 22 2021

def A346507upto(lim): return sorted(set(a*b for a in range(11, lim//11+1, 10) for b in range(a, lim//a+1, 10)))
def a(n): return len(A346507upto(10**n)) - len(A346507upto(10**(n-1)))
print([a(n) for n in range(1, 9)]) # Michael S. Branicky, Jul 22 2021

Conjecture: Lim_{n->infinity} a(n)/a(n-1) = 10.

a(6)-a(9) from Michael S. Branicky, Jul 22 2021
a(10) from David A. Corneth, Jul 22 2021
a(11) from Michael S. Branicky, Jul 23 2021
a(11) corrected and extended with a(12) by Martin Ehrenstein, Aug 03 2021
a(13)-a(14) from Martin Ehrenstein, Aug 05 2021

A346952 Number of positive integers with n digits that are the product of two integers ending with 3.

Original entry on oeis.org

1, 3, 37, 398, 4303, 45765, 480740, 5005328, 51770770, 532790460, 5461696481, 55814395421, 568944166801, 5787517297675

Offset: 1

Stefano Spezia, Aug 08 2021

a(n) is the number of n-digit numbers in A346950.

Cf. A017377, A052268, A346509 (ending with 1), A337855 (ending with 5), A337856 (ending with 6), A346950.

Table[{lo,hi}={10^(n-1),10^n};Length@Select[Union@Flatten@Table[a*b,{a,3,Floor[hi/3],10},{b,a,Floor[hi/a],10}],lo<#Giorgos Kalogeropoulos, Aug 16 2021 *)

def a(n):
  lo, hi = 10**(n-1), 10**n
  return len(set(a*b for a in range(3, hi//3+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi))
print([a(n) for n in range(1, 9)]) # Michael S. Branicky, Aug 09 2021

a(n) < A052268(n).

Conjecture: Lim_{n->infinity} a(n)/a(n-1) = 10.

a(6)-a(11) from Michael S. Branicky, Aug 09 2021

a(12)-a(14) from Martin Ehrenstein, Aug 22 2021

A263476 Total number of n-digit positive integers with multiplicative digital root value 0.

Original entry on oeis.org

0, 24, 452, 6263, 75662, 820207, 8491909, 86727773, 879578102, 8878382430, 89326016765, 896499124003, 8981948713433, 89902031287356, 899441785434096, 8996797304009863, 89981980972837834, 899900967867894143, 8999467457237611688, 89997196286115385871

Offset: 1

Martin Renner, Oct 19 2015

First differences of A263470.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50

Cf. A031347, A034048, A263470.

Last /@ Tally@ IntegerLength@ Select[Range[0, 10^6 - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 0 &] (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 0, 1, 0));  \\ Altug Alkan, Oct 19 2015

a(n) + A000012(n) + A263477(n) + A000027(n) + A263478(n) + A263479(n) + A263480(n) + A000027(n) + A263481(n) + A000217(n) = A052268(n).

a(9)-a(20) from Hiroaki Yamanouchi, Oct 25 2015

A263477 Total number of n-digit positive integers with multiplicative digital root value 2.

Original entry on oeis.org

1, 8, 68, 466, 2670, 13460, 69420, 417722, 3025242, 21873040, 136901413, 722201372, 3271729383, 13114173697, 48104723380, 167526488628, 574289772576, 1988721563904, 7000834741144, 24759698208450, 86342520209963, 292206955736762, 950480594161453

Offset: 1

Martin Renner, Oct 19 2015

First differences of A263471.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50
Eric Weisstein's World of Mathematics, Multiplicative Digital Root

Cf. A031347, A034049, A051813, A263471.

Last /@ Tally@ IntegerLength@ Select[Range@ 1000000, FixedPoint[Times @@ IntegerDigits@ # &, #] == 2 &] (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 2, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263476(n) + A000012(n) + a(n) + A000027(n) + A263478(n) + A263479(n) + A263480(n) + A000027(n) + A263481(n) + A000217(n) = A052268(n).

a(9)-a(23) from Hiroaki Yamanouchi, Oct 25 2015

A263478 Total number of n-digit positive integers with multiplicative digital root value 4.

Original entry on oeis.org

1, 9, 55, 214, 615, 1451, 3829, 60180, 939045, 8732485, 56961531, 289887214, 1229099287, 4756606869, 24218431805, 233925901576, 2661527233449, 25685325408201, 203451565638511, 1356903584035110, 7832822232934951, 40022453239462639, 184228949831881593

Offset: 1

Martin Renner, Oct 19 2015

First differences of A263472.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50

Cf. A031347, A034051, A263472.

Last /@ Tally@ IntegerLength@ Select[Range@ 1000000, FixedPoint[Times @@ IntegerDigits@ # &, #] == 4 &] (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 4, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263476(n) + A000012(n) + A263477(n) + A000027(n) + a(n) + A263479(n) + A263480(n) + A000027(n) + A263481(n) + A000217(n) = A052268(n).

a(9)-a(23) from Hiroaki Yamanouchi, Oct 25 2015

Previous Showing 31-40 of 76 results. Next

cp's OEIS Frontend

A181401 Total number of n-digit numbers requiring 6 positive cubes in their representation as sum of cubes.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A181403 Total number of n-digit numbers requiring 7 positive cubes in their representation as sum of cubes.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A181405 Total number of n-digit numbers requiring 8 positive cubes in their representation as sum of cubes.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A200139 Triangle T(n,k), read by rows, given by (1,1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A263479 Total number of n-digit positive integers with multiplicative digital root value 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A346509 Number of positive integers with n digits that are the product of two integers greater than 1 and ending with 1.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Python

Formula

Extensions

A346952 Number of positive integers with n digits that are the product of two integers ending with 3.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A263476 Total number of n-digit positive integers with multiplicative digital root value 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI