The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214882 A007185(n)/5^n. 4
 1, 1, 5, 1, 29, 57, 37, 33, 109, 841, 373, 3761, 8125, 9817, 8517, 41025, 73741, 67177, 118293, 967377, 822621, 3100537, 6492133, 16397921, 33478573, 13406601, 83211957, 177703665, 35540733, 114482329, 881889925, 176377985, 35275597, 15468937385, 3093787477 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Conjecture: For any odd m 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..3000 PROG (GAP) A214882 := function(max) local result, i; result := [5]; for i in [2..max] do Add(result, result[i-1]^2 mod 10^i); od; result := List([1..max], n->result[n]/5^n); return result; end; CROSSREFS Cf. A214880, A214881, A214883. Sequence in context: A146374 A188647 A232015 * A144890 A144891 A135892 Adjacent sequences:  A214879 A214880 A214881 * A214883 A214884 A214885 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 August 4 02:10 EDT 2020. Contains 336201 sequences. (Running on oeis4.)