Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106586
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106586 Digit next to last in squares ending in 6. +0
1
1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7, 7, 5, 9, 3, 1, 1, 3, 9, 5, 7 (list; graph; listen)
OFFSET

1,2

COMMENT

Entries are always one of the odd digits 1,3,5,7,9.

Palindrome of period 10. [From Paul Curtz (bpcrtz(AT)free.fr), Jan 04 2009]

FORMULA

a(n)=(1/45)*{5*(n mod 10)+14*[(n+1) mod 10]+32*[(n+2) mod 10]-13*[(n+3) mod 10]+14*[(n+4) mod 10]+5*[(n+5) mod 10]-4*[(n+6) mod 10]+23*[(n+7) mod 10]-22*[(n+8) mod 10]-4*[(n+9) mod 10]}, wirh n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Jan 19 2009]

MATHEMATICA

Mod[Floor[ #^2/10], 10] & /@ Select[Range[700], Mod[ #^2, 10] == 6 &] (*Chandler*)

CROSSREFS

Cf. A000290.

Sequence in context: A070341 A085851 A092041 this_sequence A010633 A096418 A100811

Adjacent sequences: A106583 A106584 A106585 this_sequence A106587 A106588 A106589

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), May 10 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 13 2005

page 1

Search completed in 0.008 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research