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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020965 a(n) = Sum_{ k = 1 to infinity} floor[n * sqrt(2)^(1-k)]. 2
1, 4, 7, 10, 12, 17, 18, 23, 26, 29, 30, 37, 39, 41, 44, 50, 54, 56, 58, 63, 64, 67, 73, 77, 79, 83, 85, 88, 92, 95, 96, 104, 106, 112, 113, 117, 120, 122, 124, 131, 132, 135, 138, 142, 143, 151, 153, 158, 161, 164, 168, 171, 173, 177, 178, 183, 188, 191, 192, 197 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

C. Kimberling, Problem 10520 in Amer. Math. Mon. 103 (1996) p. 347.

LINKS

Jon E. Schoenfield, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A080734 A104280 A083032 * A065713 A184850 A090384

Adjacent sequences:  A020962 A020963 A020964 * A020966 A020967 A020968

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jan 24 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.