login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151923 a(n) = A079316(2n+1). 2

%I #8 Jul 28 2023 10:37:56

%S 3,7,11,21,25,35,45,73,77,87,97,125,135,163,191,273,277,287,297,325,

%T 335,363,391,473,483,511,539,621,649,731,813,1057,1061,1071,1081,1109,

%U 1119,1147,1175,1257,1267,1295,1323,1405,1433,1515,1597,1841,1851,1879,1907

%N a(n) = A079316(2n+1).

%H Paolo Xausa, <a href="/A151923/b151923.txt">Table of n, a(n) for n = 0..10000</a>

%F First differences give A151712.

%t A151923list[nmax_]:=Accumulate[3^DigitCount[Range[0,nmax],2,1]+1]+1;A151923list[100] (* _Paolo Xausa_, Jul 28 2023 *)

%Y Cf. A079316, A151712.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Aug 05 2009

%E More terms from _Paolo Xausa_, Jul 28 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 8 10:21 EDT 2024. Contains 375753 sequences. (Running on oeis4.)