OFFSET
1,1
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..10000
Wikipedia, Akra-Bazzi method. As of 10 Nov 2006, this article correctly gives the asymptotic, but incorrectly refers to merge-sort rather than binary insertion sort.
MAPLE
A001855 := proc(n) local c ; c := ceil(log[2](n)) ; n*c-2^c+1 ; end: for n from 1 to 300 do srts := A001855(n) : if isprime(srts) then printf("%d, ", srts) ; fi ; od : # R. J. Mathar, Dec 16 2006
MATHEMATICA
Select[Accumulate[BitLength[Range[0, 300]]], PrimeQ] (* Paolo Xausa, Jun 28 2024 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Nov 10 2006
EXTENSIONS
Corrected and extended by R. J. Mathar, Dec 16 2006
STATUS
approved