The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A263535 a(1) = 1; thereafter a(n) = a(n-1) + d_1^1 + d_2^2 + d_3^3 + ..., where d_1 d_2 d_3 ... is the decimal expansion of a(n-1). 1
1, 2, 4, 8, 16, 53, 67, 122, 135, 270, 321, 329, 1065, 1907, 4390, 5132, 5181, 5700, 5754, 6189, 13269, 73632, 73977, 93930, 94758, 128519, 661103, 661876, 729478, 1009425, 1095200, 1096587, 2187425, 2269554, 2311471, 2430158, 4542981, 4864284, 5143384, 5422306 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This additive sequence will tend to be geometric.
LINKS
EXAMPLE
a(5)=16, so a(6) is 16 + 1^1 + 6^2 = 53.
MATHEMATICA
NestList[#+Total[IntegerDigits[#]^Range[IntegerLength[#]]]&, 1, 40] (* Harvey P. Dale, Jan 19 2021 *)
PROG
(Python)
def moda(n):
return sum(int(d)**(i + 1) for i, d in enumerate(str(n)))
b = 1
resu = [1]
for a in range(1, 100):
b += moda(b)
resu.append(b)
resu
(Sage) A=[1]
for i in [1..2000]:
A.append(A[i-1]+sum(A[i-1].digits()[len(A[i-1].digits())-1-j]^(j+1) for j in [0..len(A[i-1].digits())-1]))
A # Tom Edgar, Oct 20 2015
(PARI) lista(nn) = {print1(a=1, ", "); for (n=2, nn, d = digits(a); na = a + sum(i=1, #d, d[i]^i); print1(na, ", "); a = na; ); } \\ Michel Marcus, Nov 20 2015
CROSSREFS
Sequence in context: A264635 A046237 A013084 * A018681 A367172 A018735
KEYWORD
nonn,base
AUTHOR
Pieter Post, Oct 20 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 June 7 05:04 EDT 2024. Contains 373140 sequences. (Running on oeis4.)