login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006960 Reverse and Add! sequence starting with 196.
(Formerly M5410)
40
196, 887, 1675, 7436, 13783, 52514, 94039, 187088, 1067869, 10755470, 18211171, 35322452, 60744805, 111589511, 227574622, 454050344, 897100798, 1794102596, 8746117567, 16403234045, 70446464506, 130992928913, 450822227944, 900544455998, 1800098901007 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(0) = 196; a(n+1) = a(n) + A006960(a(n)).

196 is conjectured to be the smallest initial term which does not lead to a palindrome. John Walker, Tim Irvin and others have extended the trajectory of 196 to millions of digits without finding a palindrome.

REFERENCES

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 196, p. 58, Ellipses, Paris 2008.

F. Gruenberger, Computer Recreations, Scientific American, 250 (No. 4, 1984), 19-26.

R. K. Guy, What's left?, preprint, 1998.

D. H. Lehmer, "Sujets d'etude. No. 74," Sphinx (Bruxelles), 8 (1938), 12-13. (This is the currently earliest known reference to the 196 Problem). -  James D. Klein, Apr 09 2012.

Daniel Lignon, Dictionnaire de (presque) tous les nombres entiers, Ellipses, Paris, 2012, 702 pages. See Entry 196.

Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 70.

Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975), pages PC30-6 to PC30-9.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe and Michael Lee, Table of n, a(n) for n = 0..2390 (T. D. Noe supplied terms 0 to 200)

P. De Geest, Some thematic websources

Jason Doucette, World Records

Martianus Frederic Ezerman, Bertrand Meyer and Patrick Sole, On Polynomial Pairs of Integers, arXiv:1210.7593. 2012. - From N. J. A. Sloane, Nov 08 2012

Felix Fröhlich, C++ program for this sequence

T. Irvin, About Two Months of Computing, or An Addendum to Mr. Walker's Three Years of Computing

Madras Math's Amazing Number Facts, The Ultimate Palindrome

I. Peter, More trajectories

Wade VanLandingham, 196

J. Walker, Three Years Of Computing: Final Report On The Palindrome Quest

Eric Weisstein's World of Mathematics, 196-Algorithm.

Eric Weisstein's World of Mathematics, Palindromic Number Conjecture.

Index entries for sequences related to Reverse and Add!

MAPLE

a:= proc(n) option remember; `if`(n=0, 196, (h-> h+ (s->

      parse(cat(s[-i]$i=1..length(s))))(""||h))(a(n-1)))

    end:

seq(a(n), n=0..40);  # Alois P. Heinz, Jul 25 2014

MATHEMATICA

a = {196}; For[i = 2, i < 26, i++, a = Append[a, a[[i - 1]] + ToExpression[ StringReverse[ToString[a[[i - 1]]]]]]]; a

NestList[#+FromDigits[Reverse[IntegerDigits[#]]]&, 196, 25] (* Harvey P. Dale, Jun 05 2011 *)

PROG

(Haskell)

a006960 n = a006960_list !! n

a006960_list = iterate a056964 196 -- Reinhard Zumkeller, Sep 22 2011

CROSSREFS

Cf. A006960, A023108, A023109, A033665, A016016, A056964, A004086.

Sequence in context: A089493 A088753 A063048 * A014798 A251308 A251301

Adjacent sequences:  A006957 A006958 A006959 * A006961 A006962 A006963

KEYWORD

nonn,base,nice,easy

AUTHOR

N. J. A. Sloane, Simon Plouffe

EXTENSIONS

More terms from Vit Planocka (planocka(AT)mistral.cz), Sep 28 2002

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 23 19:46 EDT 2017. Contains 286926 sequences.