A064834 -id:A064834 - cp's OEIS frontend

A064844 Number of iterations of x -> x + A064834(x) to reach a palindrome, starting with n (or -1 if no palindrome is ever reached).

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 6, 5, 6, 4, 2, 5, 7, 3, 1, 1, 0, 4, 3, 6, 2, 2, 5, 7, 1, 1, 1, 0, 4, 3, 6, 2, 2, 5, 1, 1, 1, 1, 0, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 0, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 0, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1

Offset: 1

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 25 2001

Longest sequence for n<252784 is a(250584)=2311. Is a palindromic number always reached?

			For n=16, A064834(16) = 5, so next number is 16+5 = 21. A064834(21)=1 so next number is 22. 22 is a palindrome which is reached after 2 iterations, so a(16)=2

A002113 Palindromes in base 10.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 505, 515

Offset: 1

N. J. A. Sloane

n is a palindrome (i.e., a(k) = n for some k) if and only if n = A004086(n). - Reinhard Zumkeller, Mar 10 2002
It seems that if n*reversal(n) is in the sequence then n = 3 or all digits of n are less than 3. - Farideh Firoozbakht, Nov 02 2014
The position of a palindrome within the sequence can be determined almost without calculation: If the palindrome has an even number of digits, prepend a 1 to the front half of the palindrome's digits. If the number of digits is odd, prepend the value of front digit + 1 to the digits from position 2 ... central digit. Examples: 98766789 = a(19876), 515 = a(61), 8206028 = a(9206), 9230329 = a(10230). - Hugo Pfoertner, Aug 14 2015
This sequence is an additive basis of order at most 49, see Banks link. - Charles R Greathouse IV, Aug 23 2015
The order has been reduced from 49 to 3; see the Cilleruelo-Luca and Cilleruelo-Luca-Baxter links. - Jonathan Sondow, Nov 27 2017
See A262038 for the "next palindrome" and A261423 for the "preceding palindrome" functions. - M. F. Hasler, Sep 09 2015
The number of palindromes with d digits is 10 if d = 1, and otherwise it is 9 * 10^(floor((d - 1)/2)). - N. J. A. Sloane, Dec 06 2015
Sequence A033665 tells how many iterations of the Reverse-then-add function A056964 are needed to reach a palindrome; numbers for which this will never happen are Lychrel numbers (A088753) or rather Kin numbers (A023108). - M. F. Hasler, Apr 13 2019
This sequence is an additive basis of order 3, see Cilleruelo, Luca, & Baxter and Sigg. - Charles R Greathouse IV, Apr 08 2025

Karl G. Kröber, "Palindrome, Perioden und Chaoten: 66 Streifzüge durch die palindromischen Gefilde" (1997, Deutsch-Taschenbücher; Bd. 99) ISBN 3-8171-1522-9.
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 71.
Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 50-52.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 120.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, List of first 19999 palindromes: Table of n, a(n) for n = 1..19999
Hunki Baek, Sejeong Bang, Dongseok Kim, and Jaeun Lee, A bijection between aperiodic palindromes and connected circulant graphs, arXiv:1412.2426 [math.CO], 2014.
William D. Banks, Derrick N. Hart, and Mayumi Sakata, Almost all palindromes are composite, Math. Res. Lett., Vol. 11, No. 5-6 (2004), pp. 853-868.
William D. Banks, Every natural number is the sum of forty-nine palindromes, arXiv:1508.04721 [math.NT], 2015; Integers, 16 (2016), article A3.
Javier Cilleruelo, Florian Luca and Lewis Baxter, Every positive integer is a sum of three palindromes, Mathematics of Computation, Vol. 87, No. 314 (2018), pp. 3023-3055, arXiv preprint, arXiv:1602.06208 [math.NT], 2017.
Patrick De Geest, World of Numbers.
Kritkhajohn Onphaeng, Tammatada Khemaratchatakumthorn, Phakhinkon Napp Phunphayap, and Prapanpong Pongsriiam, Exact Formulas for the Number of Palindromes in Certain Arithmetic Progressions, Journal of Integer Sequences, Vol. 27 (2024), Article 24.4.8. See p. 2.
Phakhinkon Phunphayap and Prapanpong Pongsriiam, Reciprocal sum of palindromes, arXiv:1803.00161 [math.CA], 2018.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Prapanpong Pongsriiam and Kittipong Subwattanachai, Exact Formulas for the Number of Palindromes up to a Given Positive Integer, Intl. J. of Math. Comp. Sci. (2019) 14:1, 27-46.
E. A. Schmidt, Positive Integer Palindromes. [Cached copy at the Wayback Machine]
Markus Sigg, On a conjecture of John Hoffman regarding sums of palindromic numbers, arXiv preprint (2015). arXiv:1510.07507 [math.NT]
Eric Weisstein's World of Mathematics, Palindromic Number.
Wikipedia, Palindromic number.
Index entries for sequences that are an additive basis, order 3.
Index entries for sequences related to palindromes
Index entries for "core" sequences

Subsequence of A061917 and A221221.
A110745 is a subsequence.
Union of A056524 and A056525.
Palindromes in bases 2 through 11: A006995 and A057148, A014190 and A118594, A014192 and A118595, A029952 and A118596, A029953 and A118597, A029954 and A118598, A029803 and A118599, A029955 and A118600, this sequence, A029956. Also A262065 (base 60), A262069 (subsequence).
Palindromic primes: A002385. Palindromic nonprimes: A032350.
Palindromic-pi: A136687.
Cf. A029742 (complement), A086862 (first differences).
Palindromic floor function: A261423, also A261424. Palindromic ceiling: A262038.
Cf. A004086 (read n backwards), A064834, A118031, A136522 (characteristic function), A178788.
Ways to write n as a sum of three palindromes: A261132, A261422.
Minimal number of palindromes that add to n using greedy algorithm: A088601.
Minimal number of palindromes that add to n: A261675.

Filtered([0..550],n->ListOfDigits(n)=Reversed(ListOfDigits(n))); # Muniru A Asiru, Mar 08 2019

a002113 n = a002113_list !! (n-1)
  a002113_list = filter ((== 1) . a136522) [1..] -- Reinhard Zumkeller, Oct 09 2011

import Data.List.Ordered (union)
  a002113_list = union a056524_list a056525_list -- Reinhard Zumkeller, Jul 29 2015, Dec 28 2011

[n: n in [0..600] | Intseq(n, 10) eq Reverse(Intseq(n, 10))]; // Vincenzo Librandi, Nov 03 2014

read transforms; t0:=[]; for n from 0 to 2000 do if digrev(n) = n then t0:=[op(t0),n]; fi; od: t0;
# Alternatively, to get all palindromes with <= N digits in the list "Res":
N:=5;
Res:= $0..9:
for d from 2 to N do
  if d::even then
    m:= d/2;
    Res:= Res, seq(n*10^m + digrev(n),n=10^(m-1)..10^m-1);
  else
    m:= (d-1)/2;
    Res:= Res, seq(seq(n*10^(m+1)+y*10^m+digrev(n),y=0..9),n=10^(m-1)..10^m-1);
  fi
od: Res:=[Res]: # Robert Israel, Aug 10 2014
# A variant: Gets all base-10 palindromes with exactly d digits, in the list "Res"
d:=4:
if d=1 then Res:= [$0..9]:
elif d::even then
    m:= d/2:
    Res:= [seq(n*10^m + digrev(n), n=10^(m-1)..10^m-1)]:
else
    m:= (d-1)/2:
    Res:= [seq(seq(n*10^(m+1)+y*10^m+digrev(n), y=0..9), n=10^(m-1)..10^m-1)]:
fi:
Res; # N. J. A. Sloane, Oct 18 2015
isA002113 := proc(n)
    simplify(digrev(n) = n) ;
end proc: # R. J. Mathar, Sep 09 2015

palQ[n_Integer, base_Integer] := Module[{idn = IntegerDigits[n, base]}, idn == Reverse[idn]]; (* then to generate any base-b sequence for 1 < b < 37, replace the 10 in the following instruction with b: *) Select[Range[0, 1000], palQ[#, 10] &]
base10Pals = {0}; r = 2; Do[Do[AppendTo[base10Pals, n * 10^(IntegerLength[n] - 1) + FromDigits@Rest@Reverse@IntegerDigits[n]], {n, 10^(e - 1), 10^e - 1}]; Do[AppendTo[base10Pals, n * 10^IntegerLength[n] + FromDigits@Reverse@IntegerDigits[n]], {n, 10^(e - 1), 10^e - 1}], {e, r}]; base10Pals (* Arkadiusz Wesolowski, May 04 2012 *)
nthPalindromeBase[n_, b_] := Block[{q = n + 1 - b^Floor[Log[b, n + 1 - b^Floor[Log[b, n/b]]]], c = Sum[Floor[Floor[n/((b + 1) b^(k - 1) - 1)]/(Floor[n/((b + 1) b^(k - 1) - 1)] - 1/b)] - Floor[Floor[n/(2 b^k - 1)]/(Floor[n/(2 b^k - 1)] - 1/ b)], {k, Floor[Log[b, n]]}]}, Mod[q, b] (b + 1)^c * b^Floor[Log[b, q]] + Sum[Floor[Mod[q, b^(k + 1)]/b^k] b^(Floor[Log[b, q]] - k) (b^(2 k + c) + 1), {k, Floor[Log[b, q]]}]] (* after the work of Eric A. Schmidt, works for all integer bases b > 2 *)
Array[nthPalindromeBase[#, 10] &, 61, 0] (* please note that Schmidt uses a different, a more natural and intuitive offset, that of a(1) = 1. - Robert G. Wilson v, Sep 22 2014 and modified Nov 28 2014 *)
Select[Range[10^3], PalindromeQ] (* Michael De Vlieger, Nov 27 2017 *)
nLP[cn_Integer]:=Module[{s,len,half,left,pal,fdpal},s=IntegerDigits[cn]; len=Length[s]; half=Ceiling[len/2]; left=Take[s,half]; pal=Join[left,Reverse[ Take[left,Floor[len/2]]]]; fdpal=FromDigits[pal]; Which[cn==9,11,fdpal>cn,fdpal,True,left=IntegerDigits[ FromDigits[left]+1]; pal=Join[left,Reverse[Take[left,Floor[len/2]]]]; FromDigits[pal]]]; NestList[nLP,0,100] (* Harvey P. Dale, Dec 10 2024 *)

is_A002113(n)=Vecrev(n=digits(n))==n \\ M. F. Hasler, Nov 17 2008, updated Apr 26 2014, Jun 19 2018

is(n)=n=digits(n);for(i=1,#n\2,if(n[i]!=n[#n+1-i],return(0))); 1 \\ Charles R Greathouse IV, Jan 04 2013

a(n)={my(d,i,r);r=vector(#digits(n-10^(#digits(n\11)))+#digits(n\11));n=n-10^(#digits(n\11));d=digits(n);for(i=1,#d,r[i]=d[i];r[#r+1-i]=d[i]);sum(i=1,#r,10^(#r-i)*r[i])} \\ David A. Corneth, Jun 06 2014

\\ recursive--feed an element a(n) and it gives a(n+1)
nxt(n)=my(d=digits(n));i=(#d+1)\2;while(i&&d[i]==9,d[i]=0;d[#d+1-i]=0;i--);if(i,d[i]++;d[#d+1-i]=d[i],d=vector(#d+1);d[1]=d[#d]=1);sum(i=1,#d,10^(#d-i)*d[i]) \\ David A. Corneth, Jun 06 2014

\\ feed a(n), returns n.
inv(n)={my(d=digits(n));q=ceil(#d/2);sum(i=1,q,10^(q-i)*d[i])+10^floor(#d/2)} \\ David A. Corneth, Jun 18 2014

inv_A002113(P)={P\(P=10^(logint(P+!P,10)\/2))+P} \\ index n of palindrome P = a(n), much faster than above: no sum is needed. - M. F. Hasler, Sep 09 2018

A002113(n,L=logint(n,10))=(n-=L=10^max(L-(n<11*10^(L-1)),0))*L+fromdigits(Vecrev(digits(if(nM. F. Hasler, Sep 11 2018

# edited by M. F. Hasler, Jun 19 2018
def A002113_list(nMax):
  mlist=[]
  for n in range(nMax+1):
     mstr=str(n)
     if mstr==mstr[::-1]:
        mlist.append(n)
  return mlist # Bill McEachen, Dec 17 2010

from itertools import chain
A002113 = sorted(chain(map(lambda x:int(str(x)+str(x)[::-1]),range(1,10**3)),map(lambda x:int(str(x)+str(x)[-2::-1]), range(10**3)))) # Chai Wah Wu, Aug 09 2014

from itertools import chain, count
A002113 = chain(k for k in count(0) if str(k) == str(k)[::-1])
print([next(A002113) for k in range(60)]) # Jan P. Hartkopf, Apr 10 2021

is_A002113 = lambda n: (s:=str(n))[::-1]==s # M. F. Hasler, May 23 2024

from math import log10, floor
def A002113(n):
  if n < 2: return 0
  P = 10**floor(log10(n//2)); M = 11*P
  s = str(n - (P if n < M else M-P))
  return int(s + s[-2 if n < M else -1::-1]) # M. F. Hasler, Jun 06 2024

[n for n in (0..515) if Word(n.digits()).is_palindrome()] # Peter Luschny, Sep 13 2018

def palQ(n: Int, b: Int = 10): Boolean = n - Integer.parseInt(n.toString.reverse) == 0
(0 to 999).filter(palQ()) // _Alonso del Arte, Nov 10 2019

A136522(a(n)) = 1.
A178788(a(n)) = 0 for n > 9. - Reinhard Zumkeller, Jun 30 2010
A064834(a(n)) = 0. - Reinhard Zumkeller, Sep 18 2013
a(n+1) = A262038(a(n)+1). - M. F. Hasler, Sep 09 2015
Sum_{n>=2} 1/a(n) = A118031. - Amiram Eldar, Oct 17 2020
a(n) = (floor(d(n)/(c(n)*9 + 1)))*10^A055642(d(n)) + A004086(d(n)) where b(n, k) = ceiling(log((n + 1)/k)/log(10)), c(n) = b(n, 2) - b(n, 11) and d(n) = (n - A086573(b(n*(2 - c(n)), 2) - 1)/2 - 1). - Alan Michael Gómez Calderón, Mar 11 2025

A136522 a(n) = 1 if n is a palindrome, otherwise 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, Apr 21 2008

a(A002113(n)) = 1; a(A029742(n)) = 0.

a(n) = A202022(n) for n <= 100, a(101) = 1, A202022(101) = 0. - Reinhard Zumkeller, Dec 10 2011

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Index entries for characteristic functions
Index entries for sequences related to palindromes

Cf. A002113, A136687, A137180.

Cf. A178225.

a136522 n = fromEnum $ n == a004086 n  -- Reinhard Zumkeller, Apr 08 2011

fQ[n_]:=Module[{id=IntegerDigits[n]}, Boole[id==Reverse[id]]]; Array[fQ, 100] (* Vladimir Joseph Stephan Orlovsky, Dec 29 2010 *)
Table[If[PalindromeQ[n],1,0],{n,0,120}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 23 2019 *)

def A136522(n): return int((s:=str(n))[:(t:=(len(s)+1)//2)]==s[:-t-1:-1]) # Chai Wah Wu, Jun 23 2022

a(n) = if A004086(n) = n then 1 else 0. - Reinhard Zumkeller, Apr 08 2011

a(n) = A000007(A064834(n)). - Reinhard Zumkeller, Sep 18 2013

A029742 Nonpalindromic numbers.

Original entry on oeis.org

10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 100, 102, 103, 104, 105, 106, 107

Offset: 1

Patrick De Geest

Complement of A002113; A136522(a(n)) = 0.

A064834(a(n)) > 0. - Reinhard Zumkeller, Sep 18 2013

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Patrick De Geest, World!Of Numbers
Index entries for sequences related to palindromes

Cf. A002113. Different from A031955.

a029742 n = a029742_list !! (n-1)
a029742_list = filter ((== 0) . a136522) [1..]
-- Reinhard Zumkeller, Oct 09 2011

[n: n in [0..150] | Intseq(n) ne Reverse(Intseq(n))]; // Bruno Berselli, Apr 01 2015

palQ[n_]:=Module[{idn=IntegerDigits[n]},idn==Reverse[idn]]; DeleteCases[ Range[10,110],?palQ] (* _Harvey P. Dale, Jan 28 2012 *)
Table[If[PalindromeQ[n],Nothing,n],{n,120}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 13 2019 *)

is(n)=my(d=digits(n)); d!=Vecrev(d) \\ Charles R Greathouse IV, Feb 06 2017

def ok(n): s = str(n); return s != s[::-1]
print(list(filter(ok, range(108)))) # Michael S. Branicky, Oct 12 2021

def A029742(n):
    def f(x): return n+x//10**((l:=len(s:=str(x)))-(k:=l+1>>1))-(int(s[k-1::-1])>x%10**k)+10**(k-1+(l&1^1))-1
    m, k = n, f(n)
    while m != k:
        m, k = k, f(k)
    return m # Chai Wah Wu, Jul 24 2024

Offset corrected by Reinhard Zumkeller, Oct 09 2011

A037904 Greatest digit of n - least digit of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 9

Offset: 1

Clark Kimberling

a(n) = A054055(n)-A054054(n); a(A010785(n)) = 0; for k>0: a(n) = a(n*10^k + A000030(n)) = a(n*10^k + A010879(n)) = a(n*10^k + A054054(n)) = a(n*10^k + A054055(n)) . - Reinhard Zumkeller, Dec 14 2007; corrected by David Wasserman, May 21 2008

R. Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A040163, A064834.

a037904 = f 9 0 where
   f u v 0 = v - u
   f u v z = f (min u d) (max v d) z' where (z', d) = divMod z 10
-- Reinhard Zumkeller, Dec 16 2013

f:= n -> (max-min)(convert(n,base,10)):
map(f, [$1..1000]); # Robert Israel, Jul 07 2016

f[n_] := Block[{d = IntegerDigits[n]}, Max[d] - Min[d]]; Table[ f[n], {n, 1, 15}]

a(n)=my(d=digits(n)); vecmax(d)-vecmin(d) \\ Charles R Greathouse IV, Feb 07 2017

def A037904(n): return int(max(s:=str(n)))-int(min(s)) # Chai Wah Wu, Nov 10 2023

Incorrect comments deleted by Robert Israel, Jul 07 2016

A037888 a(n) = (1/2)Sum_{i} |d(i) - e(i)| where Sum_{i} d(i)2^i is the base-2 representation of n and e(i) are digits d(i) in reverse order.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 2, 1, 1, 0, 2, 1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 1, 0, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 3

Offset: 1

Clark Kimberling

a(n) = least number of digits for which the change 0->1 in (binary n) yields a palindrome.
a(n) = Sum_{k=0..A070939(n)/2-1} abs(A030308(n, k) - A030308(n, A070939(n)-k)). - Reinhard Zumkeller, Apr 09 2013
a(n) = Sum_{k=0..A070939(n)/2-1} ((A030308(n, k) + A030308(n, A070939(n)-k)) mod 2). - Reinhard Zumkeller, Sep 18 2013

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A064834.

a037888 n = div (sum $ map abs $ zipWith (-) bs $ reverse bs) 2
   where bs = a030308_row n
-- Reinhard Zumkeller, Apr 09 2013

a:= proc(n) local r, ad: r:= proc(s) options operator, arrow: [seq(s[nops(s)-j+1], j = 1 .. nops(s))] end proc: ad := proc(s) local i,j: j := 0: for i to nops(s) do if 0 < abs((s-r(s))[i]) then j := j+1 else end if end do: (1/2)*j end proc: ad(convert(n, base, 2)) end proc: seq(a(n), n = 1 .. 90); # Emeric Deutsch, Aug 20 2016

a[n_] := (bits = IntegerDigits[n, 2]; Total[Abs[bits - Reverse[bits]]]/2); Table[a[n], {n, 1, 90}] (* Jean-François Alcover, Jan 16 2013 *)

for(n = 1, 90,
  v = binary(n); s = 0; j = #v;
  for(k=1,#v, s+=abs(v[k]-v[j]); j--);
  s/=2;
  print1(s,", ")
)
\\ Washington Bomfim, Jan 13 2011

A135987 Records in A064844.

Original entry on oeis.org

0, 1, 6, 7, 25, 32, 33, 35, 36, 62, 89, 184, 464, 519, 1047, 1050, 1339, 2144, 2311, 6799, 12270, 19963, 19964, 22768, 80843, 80846, 93174, 150556, 162347, 656233, 688140, 1004475, 1622633

Offset: 1

Klaus Brockhaus, Dec 09 2007, corrected Dec 13 2007

Cf. A064834, A064844, A135988 (where records occur).

a(27)-a(33) from Donovan Johnson, Sep 05 2012

A135988 Indices of records in A064844.

Original entry on oeis.org

1, 10, 12, 18, 102, 1002, 1004, 1098, 1208, 1272, 1406, 10654, 13007, 23963, 100002, 100004, 148892, 160509, 250584, 1028298, 1498882, 1618607, 1618609, 2509584, 10000002, 10000004, 14998465, 16198509, 25198584, 101088834, 152088316, 161998509, 251998584

Offset: 1

Klaus Brockhaus, Dec 09 2007, corrected Dec 13 2007

Cf. A064834, A064844, A135987 (record values).

a(27)-a(33) from Donovan Johnson, Sep 05 2012

a(1) corrected by Georg Fischer, Sep 10 2023

A217774 Palindromic deviation of terms of A006960.

Original entry on oeis.org

5, 1, 5, 2, 7, 2, 1, 14, 16, 11, 2, 2, 2, 8, 2, 2, 1, 14, 4, 14, 2, 28, 11, 20, 15, 2, 21, 13, 19, 2, 17, 11, 11, 27, 4, 32, 4, 37, 12, 12, 33, 2, 13, 28, 5, 49, 17, 47, 13, 43, 6, 39, 17, 44, 6, 45, 2, 35, 8, 37, 6, 69, 15, 47, 18, 48, 10, 33, 2, 59, 15, 19, 26, 17, 17, 73, 15, 55, 15, 63, 15, 43, 17, 12, 67, 10

Offset: 0

W. W. Kokko, Mar 24 2013

nonn

Apply the map n -> PD(n) = A064834(n) to the terms of A006960.

If 196 ever reaches a palindrome (which is an open problem), a(n) will become 0.

N. J. A. Sloane, Table of n, a(n) for n = 0..2390

A275238 a(n) = n*(10^floor(log_10(n)+1) + 1) + (-1)^n.

Original entry on oeis.org

1, 10, 23, 32, 45, 54, 67, 76, 89, 98, 1011, 1110, 1213, 1312, 1415, 1514, 1617, 1716, 1819, 1918, 2021, 2120, 2223, 2322, 2425, 2524, 2627, 2726, 2829, 2928, 3031, 3130, 3233, 3332, 3435, 3534, 3637, 3736, 3839, 3938, 4041, 4140, 4243, 4342, 4445, 4544, 4647, 4746, 4849, 4948, 5051, 5150, 5253, 5352, 5455, 5554

Offset: 0

Ilya Gutkovskiy, Jul 21 2016

Concatenation of n with n+(-1)^n (A004442).
Subsequence of A248378.
Primes in this sequence: 23, 67, 89, 1213, 3637, 4243, 5051, 5657, 6263, 6869, 7879, 8081, 9091, 9293, 9697, 102103, ... (A030458).
Numbers n such that a(n) is prime: 2, 6, 8, 12, 36, 42, 50, 56, 62, 68, 78, 80, 90, 92, 96, 102, 108, 120, 126, 138, ... (A030457).

			a(0) =  0 + 1 = 1;
a(1) = 11 - 1 = 10;
a(2) = 22 + 1 = 23;
a(3) = 33 - 1 = 32;
a(4) = 44 + 1 = 45;
a(5) = 55 - 1 = 54, etc.
or
a(0) =  1 -> concatenation of 0 with 0 + (-1)^0 = 1;
a(1) = 10 -> concatenation of 1 with 1 + (-1)^1 = 0;
a(2) = 23 -> concatenation of 2 with 2 + (-1)^2 = 3;
a(3) = 32 -> concatenation of 3 with 3 + (-1)^3 = 2;
a(4) = 45 -> concatenation of 4 with 4 + (-1)^4 = 5;
a(5) = 54 -> concatenation of 5 with 5 + (-1)^5 = 4, etc.
........................................................
a(2k) = 1, 23, 45, 67, 89, 1011, 1213, 1415, 1617, 1819, ...

Cf. A001704, A002285, A004442, A020338, A030457, A030458, A030656, A033999, A064834, A248378.

Table[n (10^Floor[Log[10, n] + 1] + 1) + (-1)^n, {n, 0, 55}]

a(n) = if(n, n*(10^(logint(n,10)+1) + 1) + (-1)^n, 1) \\ Charles R Greathouse IV, Jul 21 2016

a(n) = A020338(n) + A033999(n).
a(2k) = A030656(k).
A064834(a(n)) > 0, for n > 0.
a(n) ~ 10*n*10^floor(c*log(n)), where c = 1/log(10) = 0.4342944819... = A002285.

cp's OEIS Frontend

A064844 Number of iterations of x -> x + A064834(x) to reach a palindrome, starting with n (or -1 if no palindrome is ever reached).

Views

Author

Keywords

Comments

Examples

A002113 Palindromes in base 10.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

PARI

PARI

Python

Python

Python

Python

Python

SageMath

Scala

Formula

A136522 a(n) = 1 if n is a palindrome, otherwise 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A029742 Nonpalindromic numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Python

Python

Extensions

A037904 Greatest digit of n - least digit of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Extensions

A037888 a(n) = (1/2)*Sum_{i} |d(i) - e(i)| where Sum_{i} d(i)*2^i is the base-2 representation of n and e(i) are digits d(i) in reverse order.

Views

A037888 a(n) = (1/2)Sum_{i} |d(i) - e(i)| where Sum_{i} d(i)2^i is the base-2 representation of n and e(i) are digits d(i) in reverse order.