This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214883 A016090(n)/2^n. 4
 3, 19, 47, 586, 293, 1709, 55542, 340271, 1537323, 1745224, 39935112, 19967556, 9983778, 2446398139, 22585503757, 57069119066, 333710340783, 2837143256329, 14770012057852, 7385006028926, 289794797936338, 621734557171294, 2695053069601272, 1347526534800636 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: For any m coprime to 5 and for any k, the density of n such that a(n) == k (mod m) is 1/m. LINKS Eric M. Schmidt, Table of n, a(n) for n = 1..1000 PROG (GAP) A214883 := function(max) local result, i; result := [6]; for i in [2..max] do Add(result, (2*result[i-1] - result[i-1]^2) mod 10^i); od; result := List([1..max], n->result[n]/2^n); return result; end; CROSSREFS Cf. A214880, A214881, A214882. Sequence in context: A099007 A023280 A054697 * A239449 A112627 A222185 Adjacent sequences:  A214880 A214881 A214882 * A214884 A214885 A214886 KEYWORD nonn,base AUTHOR Eric M. Schmidt, Jul 31 2012 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 18:28 EDT 2019. Contains 328022 sequences. (Running on oeis4.)