login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097509 a(n) is the number of times that n occurs as floor(k * sqrt(2)) - k. 3
3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Frequency of n in the sequence A097508. [R. J. Mathar, Sep 19 2010]

LINKS

Robert Israel, Table of n, a(n) for n = 0..10000

FORMULA

a(n) = A006337(n)-1. - Robert G. Wilson v, Aug 21 2014

Conjecture: a(n+1) = A082844(n). - Benedict W. J. Irwin, Mar 13 2016

MAPLE

S:= [seq(floor(n*sqrt(2))-n, n=0..1000)]:

seq(numboccur(i, S), i=0..max(S)); # Robert Israel, Mar 13 2016

MATHEMATICA

f[n_] := Floor[n/Cos[Pi/4]] - n; d = Array[f, 500, 0]; Tally[ Array[ f, 254, 0]][[All, 2]] (* Robert G. Wilson v, Aug 21 2014 *)

CROSSREFS

Cf. A006337, A082844, A097508.

Sequence in context: A279124 A101406 A245219 * A095206 A308006 A049071

Adjacent sequences:  A097506 A097507 A097508 * A097510 A097511 A097512

KEYWORD

easy,nonn

AUTHOR

Odimar Fabeny, Aug 26 2004

EXTENSIONS

More terms from Robert G. Wilson v, Aug 21 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 07:53 EDT 2019. Contains 324347 sequences. (Running on oeis4.)