[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A265108
The number of n-digit numbers in A264847 (pluritriangular numbers).
3
0, 4, 8, 19, 50, 142, 408, 1186, 3498, 10401, 31139, 93728, 283377, 859939, 2617798, 7990517, 24447214, 74950315, 230198869, 708160711, 2181656006, 6729833482, 20784165689, 64257670873, 198857204708, 615951476925
OFFSET
0,2
COMMENTS
In order to find a closed formula for A264847, this sequence could be useful to point out the terms in which the increment changes. For example, the increment is (a(i) + 3) from the 13th to the 31st, (a(i) + 4) from the 32nd to the 81st, etc.
Conjecture: lim_{n -> infinity} a(n)/a(n-1) = sqrt(10).
LINKS
Francesco Di Matteo, Table of n, a(n) for n = 0..100
EXAMPLE
a(1) = 4 because in A264847 there are 4 numbers with 1 digit (0, 1, 3, 6).
a(2) = 8 because in A264847 there are 8 numbers with 2 digits (10, 16, 24, 34, 46, 60, 76, 94).
MATHEMATICA
a = {0}; Do[AppendTo[a, a[[n - 1]] + Length@ Flatten@ Map[IntegerDigits, a]], {n, 2, 2000}]; Prepend[Most@ Map[Last, Tally[{1}~Join~IntegerLength@ Rest@ a]], 0] (* Michael De Vlieger, Dec 02 2015 *)
PROG
(Python)
a, b, d = 0, 0, 0
for g in range(1, 18):
h = 10**g
while a < h:
b = b + g
a = a + b
d = d + 1
print d
d = 0
CROSSREFS
Cf. A264847.
Sequence in context: A335714 A215112 A340948 * A328184 A332367 A273143
KEYWORD
nonn,base
AUTHOR
Francesco Di Matteo, Dec 01 2015
STATUS
approved