login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023859 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2), and t = A023532. 1
1, 0, 1, 3, 5, 4, 7, 6, 9, 13, 18, 17, 23, 21, 27, 25, 32, 40, 49, 47, 56, 54, 64, 62, 73, 71, 82, 94, 107, 105, 119, 117, 132, 130, 145, 142, 158, 155, 172, 190, 209, 207, 227, 224, 244, 241, 262, 259, 281, 278, 301, 298, 322, 346, 371, 368, 394, 391, 418, 415, 443, 440, 469, 466 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Michael De Vlieger, Table of n, a(n) for n = 1..10000

MATHEMATICA

Array[Sum[k Boole@ Not@ IntegerQ@ Sqrt[8 # + 9] &[# + 1 - k], {k, Floor[(# + 1)/2]}] &, 64] (* Michael De Vlieger, Jun 12 2019 *)

CROSSREFS

Sequence in context: A182733 A107431 A189827 * A096457 A277897 A082568

Adjacent sequences:  A023856 A023857 A023858 * A023860 A023861 A023862

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Title simplified by Sean A. Irvine, Jun 12 2019

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 October 21 05:28 EDT 2021. Contains 348141 sequences. (Running on oeis4.)