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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205393 Least h such that n divides the h-th difference between distinct numbers ceiling(j^2/2); the differences are ordered as in A205392. 1

%I

%S 1,2,3,2,10,5,4,9,24,14,8,7,13,27,23,12,11,31,26,18,40,65,17,16,43,90,

%T 24,33,53,23,22,42,32,152,57,31,41,189,30,29,103,40,51,75,39,275,62,

%U 38,37,96,185,102,49,61,111,48,87,434,47,46,229,495,101,59,144

%N Least h such that n divides the h-th difference between distinct numbers ceiling(j^2/2); the differences are ordered as in A205392.

%C For a guide to related sequences, see A204892.

%t (See the program at A205394.)

%Y Cf. A205394, A204892.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 27 2012

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 May 25 02:50 EDT 2013. Contains 225634 sequences.