This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120740 Numbers n such that n = Sum_digits[k*abs(n-k)] for some k>=0. 0
 0, 4, 5, 9, 14, 18, 23, 27, 32, 36, 41, 45, 50, 54, 59, 63, 68, 72, 77, 81, 86, 90, 95, 99, 104, 108, 113, 117, 122, 126, 131, 135, 140, 144, 149, 153, 158, 162, 167, 171, 176, 180, 185, 189, 194, 198, 203, 207, 212, 216, 221, 225, 230, 234, 239, 243, 248, 252 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The first difference is eventually 2-periodic: 4, 1, 4, 5, 4, 5, 4, etc. The minimum numbers k associated to the first elements of the sequence are (n,k): (0,0), (4,2), (5,7), (9,3), (14,19), (18,33), (23,67), (27,69), etc. LINKS FORMULA a(n)=9/2*(n-1)+4*{1-[(n+2) mod (n+1)]+[n!^2 mod (n+1)]*[(n+1)!^2 mod (n+2)]}+Sum{j=0..n}{(-1)^j/2}. Conjecture: a(n) = (18*n-(-1)^n-35)/4 for n>2. a(n) = a(n-1)+a(n-2)-a(n-3) for n>5. G.f.: x^2*(4+x+4*x^3)/((1-x)^2*(1+x)). [Colin Barker, Apr 10 2012] EXAMPLE n = 36 -> k = 279 -> 279*abs(36-279)=279*243=67797 -> 6+7+7+9+7 = 36 MAPLE P:=proc(n) local i, j, k, w; for i from 0 by 1 to n do for j from 0 by 1 to 100*n do w:=0; k:=j*abs(i-j); while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if w=i then print(i); break; fi; od; od; end: P(100000); CROSSREFS Cf. A130877. Sequence in context: A287209 A038099 A243166 * A274282 A000285 A042031 Adjacent sequences:  A120737 A120738 A120739 * A120741 A120742 A120743 KEYWORD nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, Jul 26 2007 STATUS approved

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

Last modified October 22 08:59 EDT 2018. Contains 316433 sequences. (Running on oeis4.)