A056964 -id:A056964 - cp's OEIS frontend

A055946 n + reversal of base 3 digits of n (written in base 10).

0, 2, 4, 4, 8, 12, 8, 12, 16, 10, 20, 30, 16, 26, 36, 22, 32, 42, 20, 30, 40, 26, 36, 46, 32, 42, 52, 28, 56, 84, 40, 68, 96, 52, 80, 108, 40, 68, 96, 52, 80, 108, 64, 92, 120, 52, 80, 108, 64, 92, 120, 76, 104, 132, 56, 84, 112, 68, 96, 124, 80, 108, 136, 68, 96, 124, 80

Offset: 0

Henry Bottomley, Jul 18 2000

If n has an even number of digits in base 3 then a(n) is a multiple of 4.

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Cf. A030102, A056964.

A055946 := proc(n)
    n+A030102(n) ;
end proc: # R. J. Mathar, May 28 2016

Array[#+FromDigits[Reverse[IntegerDigits[#,3]],3]&,70,0] (* Harvey P. Dale, Nov 09 2017 *)

a(n) = n + A030102(n).

A055950 a(n) = n + reversal of base 5 digits of n (written in base 10).

Original entry on oeis.org

0, 2, 4, 6, 8, 6, 12, 18, 24, 30, 12, 18, 24, 30, 36, 18, 24, 30, 36, 42, 24, 30, 36, 42, 48, 26, 52, 78, 104, 130, 36, 62, 88, 114, 140, 46, 72, 98, 124, 150, 56, 82, 108, 134, 160, 66, 92, 118, 144, 170, 52, 78, 104, 130, 156, 62, 88, 114, 140, 166, 72, 98, 124, 150

Offset: 0

Henry Bottomley, Jul 18 2000

If n has an even number of digits in base 5 then a(n) is a multiple of 6.

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Cf. A030104, A056964.

Table[n + IntegerReverse[n, 5], {n, 0, 100}] (* Paolo Xausa, Aug 07 2024 *)

a(n) = n + A030104(n).

A055952 n + reversal of base 6 digits of n (written in base 10).

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 7, 14, 21, 28, 35, 42, 14, 21, 28, 35, 42, 49, 21, 28, 35, 42, 49, 56, 28, 35, 42, 49, 56, 63, 35, 42, 49, 56, 63, 70, 37, 74, 111, 148, 185, 222, 49, 86, 123, 160, 197, 234, 61, 98, 135, 172, 209, 246, 73, 110, 147, 184, 221, 258, 85, 122, 159, 196

Offset: 0

Henry Bottomley, Jul 18 2000

If n has an even number of digits in base 6 then a(n) is a multiple of 7.

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Cf. A056964.

Table[n + IntegerReverse[n, 6], {n, 0, 100}] (* Paolo Xausa, Aug 08 2024 *)

a(n) = n + A030105(n).

A055956 n + reversal of base 8 digits of n (written in base 10).

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 14, 9, 18, 27, 36, 45, 54, 63, 72, 18, 27, 36, 45, 54, 63, 72, 81, 27, 36, 45, 54, 63, 72, 81, 90, 36, 45, 54, 63, 72, 81, 90, 99, 45, 54, 63, 72, 81, 90, 99, 108, 54, 63, 72, 81, 90, 99, 108, 117, 63, 72, 81, 90, 99, 108, 117, 126, 65, 130, 195, 260

Offset: 0

Henry Bottomley, Jul 18 2000

If n has an even number of digits in base 8 then a(n) is a multiple of 9.

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Cf. A030107, A056964.

Table[n + IntegerReverse[n, 8], {n, 0, 100}] (* Paolo Xausa, Aug 08 2024 *)

a(n) = n + A030107(n).

A055958 a(n) = n + reversal of base 9 digits of n (written in base 10).

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 14, 16, 10, 20, 30, 40, 50, 60, 70, 80, 90, 20, 30, 40, 50, 60, 70, 80, 90, 100, 30, 40, 50, 60, 70, 80, 90, 100, 110, 40, 50, 60, 70, 80, 90, 100, 110, 120, 50, 60, 70, 80, 90, 100, 110, 120, 130, 60, 70, 80, 90, 100, 110, 120, 130, 140, 70, 80, 90

Offset: 0

Henry Bottomley, Jul 18 2000

If n has an even number of digits in base 9 then a(n) is a multiple of 10.

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Cf. A030108, A056964.

Table[n+FromDigits[Reverse[IntegerDigits[n,9]],9],{n,0,70}] (* Harvey P. Dale, Sep 03 2013 *)

a(n) = n + fromdigits(Vecrev(digits(n, 9)), 9); \\ Michel Marcus, Sep 27 2018

a(n) = n + A030108(n).

A061226 a(n) = n^2 + (n^2 with digits reversed).

Original entry on oeis.org

0, 2, 8, 18, 77, 77, 99, 143, 110, 99, 101, 242, 585, 1130, 887, 747, 908, 1271, 747, 524, 404, 585, 968, 1454, 1251, 1151, 1352, 1656, 1271, 989, 909, 1130, 5225, 10890, 7667, 6446, 8217, 11000, 5885, 2772, 1661, 3542, 6435, 11330, 8327, 7227, 8228

Offset: 0

Amarnath Murthy, Apr 22 2001

			a(4) = 77 = 16 + 61; a(7) = 143 = 49 + 94.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Harry J. Smith)

Cf. A000290, A002942, A056964.

R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):
a:= n-> (s-> s+R(s))(n^2):
seq(a(n), n=0..50);  # Alois P. Heinz, Sep 24 2018

nsr[n_]:=Module[{n2=n^2},n2+FromDigits[Reverse[IntegerDigits[n2]]]]; Array[ nsr,50,0] (* Harvey P. Dale, Jul 23 2012 *)

{a(n) = n^2+fromdigits(Vecrev(digits(n^2)))} \\ Seiichi Manyama, Sep 24 2018

a(n) = A000290(n) + A002942(n).

More terms from Patrick De Geest, May 29 2001

A061227 a(n) = p + R(p) where R(p) is the digit reversal of n-th prime p.

Original entry on oeis.org

4, 6, 10, 14, 22, 44, 88, 110, 55, 121, 44, 110, 55, 77, 121, 88, 154, 77, 143, 88, 110, 176, 121, 187, 176, 202, 404, 808, 1010, 424, 848, 262, 868, 1070, 1090, 302, 908, 524, 928, 544, 1150, 362, 382, 584, 988, 1190, 323, 545, 949, 1151, 565, 1171, 383

Offset: 0

Amarnath Murthy, Apr 22 2001

			a(4) = 14 = 7 + 7, 7 is the fourth prime; a(8) = 110 = 19 + 91, 19 is the eighth prime.

Harvey P. Dale, Table of n, a(n) for n = 0..1000

Cf. A000040, A004086, A056964.

a061227 n = p + a004086 p  where p = a000040 n
-- Reinhard Zumkeller, Feb 04 2014

revdigs:= proc(n) local L,i;
  L:= convert(n,base,10);
  add(10^(nops(L)-j)*L[j],j=1..nops(L))
end proc:
seq(x+revdigs(x),x=select(isprime,[2,seq(i,i=3..1000,2); # Robert Israel, May 23 2016

#+FromDigits[Reverse[IntegerDigits[#]]]&/@Prime[Range[60]] (* Harvey P. Dale, Jul 13 2013 *)

a(n) = A000040(n) + A004087(n). - Reinhard Zumkeller, Feb 04 2014

a(n) = A056964(A000040(n)). - Robert Israel, May 23 2016

More terms from Patrick De Geest, Jun 04 2001

A063054 'Reverse and Add!' trajectory of 1997.

Original entry on oeis.org

1997, 9988, 18887, 97768, 184547, 930028, 1750067, 9350638, 17711177, 94822948, 179745797, 977293768, 1844686547, 9301551028, 17503102067, 93523232638, 177146465177, 948711106948, 1798312224797, 9772534363768, 18446168716547

Offset: 0

Klaus Brockhaus, Jul 07 2001

			a(1) = 1997 + 7991 = 9988.

Reinhard Zumkeller and Michael Lee, Table of n, a(n) for n = 0..2318 (terms 0 through 250 provided by Reinhard Zumkeller)
Index entries for sequences related to Reverse and Add!

A033865, A023108, A006960, A063055, A056964, A004086.

m := 1997; stop := 25; c := 0; rev := int_reverse(m); while m <> rev and c < stop do inc(c); write(m," "); m := m + rev; rev := int_reverse(m); end;

a063054 n = a063054_list !! n
a063054_list = iterate a056964 1997 -- Reinhard Zumkeller, Sep 22 2011

NestList[ #+FromDigits[ Reverse[ IntegerDigits[ # ] ] ]&, 1997, 25 ]
NestList[#+IntegerReverse[#]&,1997,25] (* Harvey P. Dale, Jul 15 2025 *)

A063060 'Reverse and Add!' trajectory of 10553.

Original entry on oeis.org

10553, 46054, 91118, 172237, 904508, 1709917, 8908988, 17807086, 85877957, 161855815, 680413976, 1359728062, 3968007593, 7925016286, 14751121583, 53263237324, 95636473559, 191173937218, 1003913308409, 10051946501410

Offset: 0

Klaus Brockhaus, Jul 07 2001

			a(1) = 10553 + 35501 = 46054.

Reinhard Zumkeller and Michael Lee, Table of n, a(n) for n = 0..2423 (terms 0 through 250 provided by Reinhard Zumkeller)
Index entries for sequences related to Reverse and Add!

A033865, A023108, A006960, A063061.

Cf. A056964, A004086.

m := 10553; stop := 25; c := 0; rev := int_reverse(m); while m <> rev and c < stop do inc(c); write(m," "); m := m + rev; rev := int_reverse(m); end;

a063060 n = a063060_list !! n
a063060_list = iterate a056964 10553 -- Reinhard Zumkeller, Sep 22 2011

NestList[# + FromDigits[Reverse[IntegerDigits[#]]]&, 10553, 40] (* Vincenzo Librandi, May 03 2014 *)

Updated b-file from Michael Lee, Apr 01 2012

A063063 'Reverse and Add!' trajectory of 10563.

Original entry on oeis.org

10563, 47064, 93138, 176277, 948948, 1798797, 9777768, 18455547, 93011028, 175022067, 935242638, 1771485177, 9487326948, 17983564797, 97730103768, 184460207547, 930162272028, 1750434533067, 9353788873638, 17717577747177

Offset: 0

Klaus Brockhaus, Jul 07 2001

			a(1) = 10563 + 36501 = 47064.

Reinhard Zumkeller and Michael Lee, Table of n, a(n) for n = 0..2383 (terms 0 through 250 provided by Reinhard Zumkeller)
Index entries for sequences related to Reverse and Add!

A033865, A023108, A006960, A063064.

Cf. A056964, A004086.

m := 10563; stop := 25; c := 0; rev := int_reverse(m); while m <> rev and c < stop do inc(c); write(m," "); m := m + rev; rev := int_reverse(m); end;

a063063 n = a063063_list !! n
a063063_list = iterate a056964 10563 -- Reinhard Zumkeller, Sep 22 2011

NestList[# + FromDigits[Reverse[IntegerDigits[#]]]&, 10563, 30] (* Vincenzo Librandi, May 03 2014 *)

cp's OEIS Frontend

A055946 n + reversal of base 3 digits of n (written in base 10).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A055950 a(n) = n + reversal of base 5 digits of n (written in base 10).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A055952 n + reversal of base 6 digits of n (written in base 10).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A055956 n + reversal of base 8 digits of n (written in base 10).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A055958 a(n) = n + reversal of base 9 digits of n (written in base 10).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A061226 a(n) = n^2 + (n^2 with digits reversed).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A061227 a(n) = p + R(p) where R(p) is the digit reversal of n-th prime p.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

Extensions

A063054 'Reverse and Add!' trajectory of 1997.