1,2

Differs from A057147 first at n=100.

a(n)/n = {1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 12, 13, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 8, 9, 10, 11, 12, 13, 14, 15, ...}. - Alexander R. Povolotsky, Jun 19 2012

Felipe Bottega Diniz and T. D. Noe, Table of n, a(n) for n = 1..1000 (first 100 terms from Felipe Bottega Diniz)

F. B. Diniz, About a New Family of Sequences, arXiv:1607.06082 [math.GM], 2016.

Let t_1t_2...t_n be a natural number.

a(t_1t_2...t_n) = (t_1 + t_2)*t_1t_2 + ... + (t_n-1 + t_n)*t_n-1t_n, if n even.

If n is odd, t_1 t_2...t_n <- 0t_1t_2...t_n and do a(0t_1 t_2...t_n).

a(123456) = (1+2)*12 + (3+4)*34 + (5+6)*56 = 890.

a(890) = (0+8)*08 + (9+0)*90 = 874.

a(15) = (1+5)*15 = 90.

a(7) = (0+7)*07 = 49.

read("transforms"):

A213630 := proc(n)

local dgs, a, i ;

if n < 10 then

n^2;

else

dgs := convert(n, base, 10) ;

a := 0 ;

for i from 2 to nops(dgs) do

a := a+(op(i-1, dgs)+op(i, dgs))*digcat2(op(i, dgs), op(i-1, dgs)) ;

end do:

a;

end if;

end proc: # R. J. Mathar, Aug 10 2012

num[n_] := Module[{d = IntegerDigits[n], d2}, If[OddQ[Length[d]], d = Prepend[d, 0]]; d2 = Partition[d, 2]; Sum[(d2[[i, 1]] + d2[[i, 2]])*(10*d2[[i, 1]] + d2[[i, 2]]), {i, Length[d2]}]]; Table[num[n], {n, 100}] (* T. D. Noe, Jun 19 2012 *)

Sequence in context: A230101 A361203 A057147 * A061205 A290934 A048387

Adjacent sequences: A213627 A213628 A213629 * A213631 A213632 A213633

easy,nonn,base

Felipe Bottega Diniz, Jun 16 2012

approved