login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)