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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A350810 a(n) = ceiling((n-R(n^2))^2/(n+R(n^2))), where R(n^2) is the digit reversal of n^2. 1
 0, 1, 3, 50, 39, 48, 75, 27, 3, 8, 92, 407, 923, 651, 479, 606, 933, 372, 114, 11, 92, 422, 859, 607, 456, 602, 850, 410, 81, 12, 96, 4106, 9703, 6410, 5117, 6814, 9521, 4329, 1139, 5, 1742, 4547, 9353, 6261, 5069, 5976, 8882, 3891, 904, 1, 919, 3919, 8925, 6032, 5041, 6147, 9254 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS This sequence gives both at large and small scales well-structured graphs; specific and periodic patterns are visible in separated layers. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 EXAMPLE For n = 1, R(n^2) = 1, thus a(1) = ceiling((1-1)^2/(1+1)) = 0. For n = 10, R(n^2) = 1, thus a(10) = ceiling((10-1)^2/(10+1)) = 8. For n = 21, R(n^2) = 144, thus a(21) = ceiling((21-144)^2/(21+144)) = 92. MATHEMATICA Table[Ceiling[(n-FromDigits[Reverse[IntegerDigits[n^2]]])^2/(n+FromDigits[Reverse[IntegerDigits[n^2]]])], {n, 57}] (* Stefano Spezia, Jan 18 2022 *) PROG (PARI) a(n) = my(x = fromdigits(Vecrev(digits(n^2)))); r = ceil((n-x)^2/(n+x)); for(n = 1, 2000, print1(a(n)", ")) (Python) def R(n): return int(str(n)[::-1]) def a(n): Rn2 = R(n**2) q, r = divmod((n-Rn2)**2, n+Rn2) return q if r == 0 else q + 1 print([a(n) for n in range(1, 67)]) # Michael S. Branicky, Jan 17 2022 CROSSREFS Cf. A000290, A002942, A004086. Sequence in context: A145572 A309869 A356640 * A356642 A012857 A246221 Adjacent sequences: A350807 A350808 A350809 * A350811 A350812 A350813 KEYWORD nonn,base,easy,look AUTHOR Claude H. R. Dequatre, Jan 17 2022 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.

Last modified April 17 18:43 EDT 2024. Contains 371765 sequences. (Running on oeis4.)