cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262569 a(n) = (A002703(n)+2)/2.

This page as a plain text file.
%I A262569 #22 Oct 20 2023 09:50:45
%S A262569 1,1,1,2,4,8,13,24,45,82,151,282,529,992,1872,3542,6720,12788,24385,
%T A262569 46600,89241,171197,328960,633102,1220160,2354688,4549753,8801162,
%U A262569 17043506,33038208,64103989,124491776,241969989,470681348,916259632,1784921474,3479467177,6787108713,13247128045,25870861824,50552258560,98832505868
%N A262569 a(n) = (A002703(n)+2)/2.
%C A262569 All of A002703, A262567, A262568 and this sequence are somewhat mysterious, so having four versions instead of one increases the chance that one of them will be found in a different context.
%H A262569 Alexander Rosa and Štefan Znám, <a href="/A002703/a002703.pdf">A combinatorial problem in the theory of congruences. (Russian)</a>, Mat.-Fys. Casopis Sloven. Akad. Vied 15 1965 49-59. [Annotated scanned copy]
%F A262569 a(n) = A262568(n)/2 = A262567(n) + 1.
%p A262569 See A262568.
%Y A262569 Cf. A002703, A252567, A262568.
%Y A262569 Tables 1 and 2 of the first Rosa-Znám 1965 paper are A053632 and A178666 respectively.
%K A262569 nonn
%O A262569 3,4
%A A262569 _N. J. A. Sloane_, Oct 20 2015
%E A262569 More terms from _R. J. Mathar_, Oct 21 2015