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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175270 Numbers k such that the least number of squares that add up to k equals the least number of triangular numbers that add up to k. Equivalently, A002828(k) = A061336(k). 1
0, 1, 2, 13, 14, 18, 19, 20, 29, 33, 34, 35, 36, 37, 44, 54, 58, 59, 61, 62, 65, 72, 73, 75, 77, 86, 90, 96, 97, 101, 106, 107, 118, 129, 130, 131, 134, 137, 138, 140, 146, 147, 148, 152, 155, 157, 158, 160, 161, 164, 166, 176, 179, 181, 184, 187, 193, 195, 200 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

PROG

(PARI) is2s(n)=my(f=factor(n>>valuation(n, 2))); for(i=1, #f~, if(bitand(f[i, 2], 1) && bitand(f[i, 1], 3)==3, return(0))); 1

is2t(n)=my(m9=n%9, f); if(m9==5 || m9==8, return(0)); is2s(4*n+1)

is(n)=my(o2=valuation(n, 2), f); if(n==0, return(1)); if(bitand(o2, 1)==0 && bitand(n>>o2, 7)==7, return(0)); if(issquare(n), return(ispolygonal(n, 3))); if(ispolygonal(n, 3), return(0)); is2t(n)==is2s(n) \\ Charles R Greathouse IV, Mar 17 2022

CROSSREFS

Cf. A000217, A000290, A002828, A061336.

Sequence in context: A153651 A229908 A335972 * A320339 A075032 A032932

Adjacent sequences: A175267 A175268 A175269 * A175271 A175272 A175273

KEYWORD

nonn,easy

AUTHOR

Ctibor O. Zizka, Mar 19 2010

EXTENSIONS

Data corrected and extended by Mohammed Yaseen, Mar 17 2022

STATUS

approved

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 November 28 22:51 EST 2022. Contains 358421 sequences. (Running on oeis4.)