Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042948
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042948 Congruent to 0 or 1 mod 4. +0
15
0, 1, 4, 5, 8, 9, 12, 13, 16, 17, 20, 21, 24, 25, 28, 29, 32, 33, 36, 37, 40, 41, 44, 45, 48, 49, 52, 53, 56, 57, 60, 61, 64, 65, 68, 69, 72, 73, 76, 77, 80, 81, 84, 85, 88, 89, 92, 93, 96, 97, 100, 101, 104, 105, 108 (list; graph; listen)
OFFSET

0,3

COMMENT

Maximum number of squares attacked by a bishop on an n X n chessboard - Stewart Gordon (smjg(AT)iname.com), Mar 23 2001

Also number of squares attacked by a bishop on a toroidal chessboard. - Diego Torres (torresvillarroel(AT)hotmail.com), May 30 2001

Numbers n such that {1,2,3,...,n-1,n} is a perfect Skolem set. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 24 2006

The number of terms which lie on the principal diagonals of an n X n square spiral. - William A. Tedeschi (fynmun(AT)hotmail.com), Mar 02 2008

REFERENCES

T. Skolem, On certain distributions of integers in pairs with given differences, Math. Scand., 1957, vol. 5, 57-68.

FORMULA

G.f.: (x+3*x^2)/((1-x)*(1-x^2)). a(n)=a(n-1)+2+(-1)^n - Michael Somos, Jan 12 2000.

MAPLE

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

seq(add(irem(3^k, 4), k=4..n), n=3..57); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008

PROGRAM

(PARI) a(n)=2*n-n%2

CROSSREFS

A042948(n) = A042963(n)-1.

Adjacent sequences: A042945 A042946 A042947 this_sequence A042949 A042950 A042951

Sequence in context: A104883 A042956 A128217 this_sequence A126001 A073320 A020668

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.005 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research