Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008851 Congruent to 0 or 1 mod 5. +0
3
0, 1, 5, 6, 10, 11, 15, 16, 20, 21, 25, 26, 30, 31, 35, 36, 40, 41, 45, 46, 50, 51, 55, 56, 60, 61, 65, 66, 70, 71, 75, 76, 80, 81, 85, 86, 90, 91, 95, 96, 100, 101, 105, 106, 110, 111, 115, 116, 120, 121, 125, 126, 130, 131, 135, 136, 140, 141, 145, 146, 150, 151 (list; graph; listen)
OFFSET

0,3

COMMENT

n^2 and n have same last digit.

REFERENCES

Dickson, History of Theory of Numbers, I, p. 459.

FORMULA

a(n)=5*n-a(n-1)-9 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 22 2009]

EXAMPLE

For n=2, a(2)=5*2-0-9=1; n=3, a(3)=5*3-1-9=5; n=4, a(4)=5*4-5-9=6 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 22 2009]

MAPLE

a[0]:=0:a[1]:=1:for n from 2 to 100 do a[n]:=a[n-2]+5 od: seq(a[n], n=0..61); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008

CROSSREFS

Sequence in context: A074627 A067612 A064957 this_sequence A079259 A029772 A046827

Adjacent sequences: A008848 A008849 A008850 this_sequence A008852 A008853 A008854

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 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 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research