A255437 In positive integers: replace k^2 with the first k odd numbers.

1, 2, 3, 1, 3, 5, 6, 7, 8, 1, 3, 5, 10, 11, 12, 13, 14, 15, 1, 3, 5, 7, 17, 18, 19, 20, 21, 22, 23, 24, 1, 3, 5, 7, 9, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 1, 3, 5, 7, 9, 11, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 1, 3, 5, 7, 9, 11, 13, 50, 51

Offset

1,2

Comments

a(A005448(n)) = 1;

conjecture: a(A068722(n)) = (2*n+1)^2, i.e. A068722(n) = gives the position of the first occurrence of n-th odd square;

A164514(n) = a(A255527(n)) and a(m) < A164514(n) for m < A255527(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Example

.  A000290 | 1,    4,          9,                      16,         . . .
.  A000027 | _,2,3,___,5,6,7,8,_____,10,11,12,13,14,15,_______,17,18,...
.  A158405 | 1,    1,3,        1,3,5,                  1,3,5,7,
.  --------+-------------------------------------------------------------
.     a(n) | 1,2,3,1,3,5,6,7,8,1,3,5,10,11,12,13,14,15,1,3,5,7,17,18,19 .

Prog

(Haskell)
a255437 n = a255437_list !! (n-1)
a255437_list = f 0 [1..] a158405_tabl where
   f k xs (zs:zss) = us ++ zs ++ f (k + 2) vs zss
                     where (us, v:vs) = splitAt k xs

Crossrefs

Cf. A256188, A000290, A000037, A158405, A016742, A164514, A255527, A005448, A255507 (first differences), A255508 (partial sums).

Sequence in context: A127951 A208814 A230449 * A162609 A194752 A194740

Adjacent sequences: A255434 A255435 A255436 * A255438 A255439 A255440

Keyword

nonn

Author

Reinhard Zumkeller, Mar 23 2015

Status

approved